./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_09-arraylist.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/goblint-regression/09-regions_09-arraylist.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 1250b991cc6af457c99698c8ecb919c369f7a178a8972aded6e4b48360bdf7f3 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:15:53,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:15:53,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:15:53,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:15:53,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:15:53,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:15:53,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:15:53,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:15:53,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:15:53,460 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:15:53,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:15:53,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:15:53,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:15:53,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:15:53,461 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:15:53,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:15:53,462 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:15:53,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:15:53,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:15:53,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:15:53,462 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:15:53,462 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:15:53,462 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:15:53,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:15:53,462 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:15:53,462 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:15:53,463 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:15:53,463 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:15:53,463 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:15:53,463 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:15:53,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:15:53,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:15:53,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:15:53,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:53,464 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:15:53,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:15:53,464 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:15:53,464 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:15:53,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:53,464 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:15:53,464 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:15:53,464 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:15:53,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:15:53,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:15:53,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:15:53,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:15:53,465 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 -> 1250b991cc6af457c99698c8ecb919c369f7a178a8972aded6e4b48360bdf7f3 [2025-04-29 11:15:53,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:15:53,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:15:53,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:15:53,692 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:15:53,692 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:15:53,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_09-arraylist.c [2025-04-29 11:15:54,980 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eb8dc36d/1a7eaea4fc1f496088f8a804413e1048/FLAGed1c62c98 [2025-04-29 11:15:55,201 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:15:55,203 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_09-arraylist.c [2025-04-29 11:15:55,204 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:15:55,204 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:15:55,204 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:15:55,218 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eb8dc36d/1a7eaea4fc1f496088f8a804413e1048/FLAGed1c62c98 [2025-04-29 11:15:56,030 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eb8dc36d/1a7eaea4fc1f496088f8a804413e1048 [2025-04-29 11:15:56,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:15:56,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:15:56,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:15:56,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:15:56,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:15:56,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:15:56" (1/1) ... [2025-04-29 11:15:56,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f346b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:56, skipping insertion in model container [2025-04-29 11:15:56,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:15:56" (1/1) ... [2025-04-29 11:15:56,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:15:56,227 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:15:56,244 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:15:56,269 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:15:56,287 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:15:56,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:56 WrapperNode [2025-04-29 11:15:56,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:15:56,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:15:56,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:15:56,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:15:56,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:56" (1/1) ... [2025-04-29 11:15:56,299 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:56" (1/1) ... [2025-04-29 11:15:56,320 INFO L138 Inliner]: procedures = 20, calls = 39, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 126 [2025-04-29 11:15:56,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:15:56,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:15:56,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:15:56,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:15:56,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:56" (1/1) ... [2025-04-29 11:15:56,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:56" (1/1) ... [2025-04-29 11:15:56,336 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:56" (1/1) ... [2025-04-29 11:15:56,351 INFO L175 MemorySlicer]: Split 29 memory accesses to 3 slices as follows [1, 14, 14]. 48 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [1, 10, 0]. The 11 writes are split as follows [0, 1, 10]. [2025-04-29 11:15:56,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:56" (1/1) ... [2025-04-29 11:15:56,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:56" (1/1) ... [2025-04-29 11:15:56,361 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:56" (1/1) ... [2025-04-29 11:15:56,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:56" (1/1) ... [2025-04-29 11:15:56,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:56" (1/1) ... [2025-04-29 11:15:56,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:56" (1/1) ... [2025-04-29 11:15:56,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:56" (1/1) ... [2025-04-29 11:15:56,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:15:56,374 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:15:56,374 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:15:56,374 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:15:56,375 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:56" (1/1) ... [2025-04-29 11:15:56,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:15:56,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:15:56,405 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-04-29 11:15:56,407 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-04-29 11:15:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:15:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:15:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-29 11:15:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:15:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:15:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-29 11:15:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:15:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:15:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:15:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-29 11:15:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-29 11:15:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:15:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:15:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-29 11:15:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:15:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:15:56,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-29 11:15:56,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:15:56,423 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:15:56,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:15:56,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:15:56,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:15:56,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:15:56,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-29 11:15:56,423 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:15:56,423 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:15:56,424 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:15:56,518 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:15:56,519 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:15:56,794 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:15:56,794 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:15:56,952 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:15:56,952 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:15:56,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:15:56 BoogieIcfgContainer [2025-04-29 11:15:56,953 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:15:56,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:15:56,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:15:56,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:15:56,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:15:56" (1/3) ... [2025-04-29 11:15:56,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491649f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:15:56, skipping insertion in model container [2025-04-29 11:15:56,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:15:56" (2/3) ... [2025-04-29 11:15:56,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491649f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:15:56, skipping insertion in model container [2025-04-29 11:15:56,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:15:56" (3/3) ... [2025-04-29 11:15:56,959 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_09-arraylist.c [2025-04-29 11:15:56,969 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:15:56,970 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_09-arraylist.c that has 2 procedures, 71 locations, 70 edges, 1 initial locations, 1 loop locations, and 37 error locations. [2025-04-29 11:15:56,970 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:15:57,018 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:15:57,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 71 transitions, 146 flow [2025-04-29 11:15:57,076 INFO L116 PetriNetUnfolderBase]: 1/70 cut-off events. [2025-04-29 11:15:57,078 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:57,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 70 events. 1/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 286 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2025-04-29 11:15:57,081 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 71 transitions, 146 flow [2025-04-29 11:15:57,085 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 70 transitions, 143 flow [2025-04-29 11:15:57,090 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:15:57,097 INFO L340 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;@1646a480, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:15:57,097 INFO L341 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-04-29 11:15:57,100 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:15:57,101 INFO L116 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-04-29 11:15:57,101 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:57,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:57,101 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-04-29 11:15:57,101 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:15:57,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:57,106 INFO L85 PathProgramCache]: Analyzing trace with hash 401293, now seen corresponding path program 1 times [2025-04-29 11:15:57,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:57,111 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051565993] [2025-04-29 11:15:57,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:57,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:57,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-29 11:15:57,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-29 11:15:57,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:57,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:57,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:57,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051565993] [2025-04-29 11:15:57,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051565993] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:57,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:57,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:15:57,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706650909] [2025-04-29 11:15:57,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:57,286 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:15:57,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:57,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:15:57,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:15:57,370 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 71 [2025-04-29 11:15:57,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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-04-29 11:15:57,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:57,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 71 [2025-04-29 11:15:57,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:57,490 INFO L116 PetriNetUnfolderBase]: 64/262 cut-off events. [2025-04-29 11:15:57,490 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:15:57,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 262 events. 64/262 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1372 event pairs, 63 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 377. Up to 151 conditions per place. [2025-04-29 11:15:57,495 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 24 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2025-04-29 11:15:57,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 66 transitions, 191 flow [2025-04-29 11:15:57,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:15:57,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:15:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2025-04-29 11:15:57,506 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6995305164319249 [2025-04-29 11:15:57,507 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 143 flow. Second operand 3 states and 149 transitions. [2025-04-29 11:15:57,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 66 transitions, 191 flow [2025-04-29 11:15:57,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 66 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:15:57,514 INFO L231 Difference]: Finished difference. Result has 70 places, 66 transitions, 142 flow [2025-04-29 11:15:57,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=70, PETRI_TRANSITIONS=66} [2025-04-29 11:15:57,519 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2025-04-29 11:15:57,520 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 66 transitions, 142 flow [2025-04-29 11:15:57,521 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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-04-29 11:15:57,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:57,521 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-04-29 11:15:57,521 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:15:57,521 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:15:57,522 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:57,522 INFO L85 PathProgramCache]: Analyzing trace with hash 401294, now seen corresponding path program 1 times [2025-04-29 11:15:57,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:57,522 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839067629] [2025-04-29 11:15:57,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:57,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:57,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-29 11:15:57,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-29 11:15:57,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:57,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:57,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:57,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839067629] [2025-04-29 11:15:57,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839067629] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:57,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:57,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:15:57,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958074653] [2025-04-29 11:15:57,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:57,642 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:15:57,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:57,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:15:57,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:15:57,694 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 71 [2025-04-29 11:15:57,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:57,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:57,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 71 [2025-04-29 11:15:57,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:57,776 INFO L116 PetriNetUnfolderBase]: 64/258 cut-off events. [2025-04-29 11:15:57,776 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-29 11:15:57,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 258 events. 64/258 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1340 event pairs, 63 based on Foata normal form. 4/207 useless extension candidates. Maximal degree in co-relation 385. Up to 151 conditions per place. [2025-04-29 11:15:57,778 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 22 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2025-04-29 11:15:57,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 62 transitions, 186 flow [2025-04-29 11:15:57,778 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:15:57,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:15:57,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2025-04-29 11:15:57,779 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7183098591549296 [2025-04-29 11:15:57,779 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 142 flow. Second operand 3 states and 153 transitions. [2025-04-29 11:15:57,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 62 transitions, 186 flow [2025-04-29 11:15:57,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 62 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:15:57,780 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 134 flow [2025-04-29 11:15:57,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2025-04-29 11:15:57,781 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -7 predicate places. [2025-04-29 11:15:57,781 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 134 flow [2025-04-29 11:15:57,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:57,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:57,781 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:15:57,781 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:15:57,782 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:15:57,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:57,782 INFO L85 PathProgramCache]: Analyzing trace with hash 385653302, now seen corresponding path program 1 times [2025-04-29 11:15:57,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:57,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180726081] [2025-04-29 11:15:57,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:57,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:57,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:15:57,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:15:57,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:57,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:57,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:57,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180726081] [2025-04-29 11:15:57,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180726081] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:57,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:57,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:15:57,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370717233] [2025-04-29 11:15:57,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:57,975 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:15:57,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:57,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:15:57,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:15:58,119 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 71 [2025-04-29 11:15:58,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:58,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:58,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 71 [2025-04-29 11:15:58,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:58,262 INFO L116 PetriNetUnfolderBase]: 81/317 cut-off events. [2025-04-29 11:15:58,262 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-29 11:15:58,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 317 events. 81/317 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1653 event pairs, 80 based on Foata normal form. 2/249 useless extension candidates. Maximal degree in co-relation 475. Up to 193 conditions per place. [2025-04-29 11:15:58,267 INFO L140 encePairwiseOnDemand]: 60/71 looper letters, 33 selfloop transitions, 6 changer transitions 0/69 dead transitions. [2025-04-29 11:15:58,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 69 transitions, 234 flow [2025-04-29 11:15:58,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:15:58,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:15:58,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2025-04-29 11:15:58,269 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.647887323943662 [2025-04-29 11:15:58,269 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 134 flow. Second operand 4 states and 184 transitions. [2025-04-29 11:15:58,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 69 transitions, 234 flow [2025-04-29 11:15:58,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 69 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:15:58,272 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 178 flow [2025-04-29 11:15:58,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2025-04-29 11:15:58,273 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2025-04-29 11:15:58,273 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 178 flow [2025-04-29 11:15:58,273 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:15:58,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:58,274 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:58,274 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:15:58,274 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:15:58,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:58,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1228033838, now seen corresponding path program 1 times [2025-04-29 11:15:58,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:58,274 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496450287] [2025-04-29 11:15:58,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:58,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:58,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:15:58,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:15:58,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:58,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:58,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:58,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496450287] [2025-04-29 11:15:58,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496450287] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:58,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:58,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:15:58,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486632345] [2025-04-29 11:15:58,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:58,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:15:58,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:58,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:15:58,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:15:58,774 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 71 [2025-04-29 11:15:58,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 178 flow. Second operand has 7 states, 7 states have (on average 37.285714285714285) internal successors, (261), 7 states have internal predecessors, (261), 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-04-29 11:15:58,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:58,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 71 [2025-04-29 11:15:58,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:58,895 INFO L116 PetriNetUnfolderBase]: 64/270 cut-off events. [2025-04-29 11:15:58,895 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-29 11:15:58,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 270 events. 64/270 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1323 event pairs, 63 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 421. Up to 148 conditions per place. [2025-04-29 11:15:58,897 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 23 selfloop transitions, 11 changer transitions 0/65 dead transitions. [2025-04-29 11:15:58,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 65 transitions, 242 flow [2025-04-29 11:15:58,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:15:58,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:15:58,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 283 transitions. [2025-04-29 11:15:58,898 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5694164989939637 [2025-04-29 11:15:58,898 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 178 flow. Second operand 7 states and 283 transitions. [2025-04-29 11:15:58,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 65 transitions, 242 flow [2025-04-29 11:15:58,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 65 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:15:58,900 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 194 flow [2025-04-29 11:15:58,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=194, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2025-04-29 11:15:58,901 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -1 predicate places. [2025-04-29 11:15:58,901 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 194 flow [2025-04-29 11:15:58,901 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.285714285714285) internal successors, (261), 7 states have internal predecessors, (261), 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-04-29 11:15:58,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:58,901 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:58,901 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:15:58,901 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:15:58,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:58,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1228033837, now seen corresponding path program 1 times [2025-04-29 11:15:58,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:58,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610903453] [2025-04-29 11:15:58,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:58,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:58,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:15:58,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:15:58,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:58,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:59,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:59,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:59,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610903453] [2025-04-29 11:15:59,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610903453] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:59,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:59,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:15:59,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978991524] [2025-04-29 11:15:59,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:59,203 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:15:59,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:59,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:15:59,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:15:59,501 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 71 [2025-04-29 11:15:59,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 194 flow. Second operand has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 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-04-29 11:15:59,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:59,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 71 [2025-04-29 11:15:59,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:59,634 INFO L116 PetriNetUnfolderBase]: 64/266 cut-off events. [2025-04-29 11:15:59,635 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-29 11:15:59,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 266 events. 64/266 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1303 event pairs, 63 based on Foata normal form. 2/215 useless extension candidates. Maximal degree in co-relation 402. Up to 148 conditions per place. [2025-04-29 11:15:59,636 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 22 selfloop transitions, 11 changer transitions 0/63 dead transitions. [2025-04-29 11:15:59,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 63 transitions, 256 flow [2025-04-29 11:15:59,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:15:59,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:15:59,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 261 transitions. [2025-04-29 11:15:59,637 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5251509054325956 [2025-04-29 11:15:59,638 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 194 flow. Second operand 7 states and 261 transitions. [2025-04-29 11:15:59,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 63 transitions, 256 flow [2025-04-29 11:15:59,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 63 transitions, 234 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-29 11:15:59,639 INFO L231 Difference]: Finished difference. Result has 70 places, 63 transitions, 190 flow [2025-04-29 11:15:59,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=190, PETRI_PLACES=70, PETRI_TRANSITIONS=63} [2025-04-29 11:15:59,640 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2025-04-29 11:15:59,640 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 63 transitions, 190 flow [2025-04-29 11:15:59,640 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 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-04-29 11:15:59,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:59,640 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:59,640 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:15:59,641 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:15:59,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:59,642 INFO L85 PathProgramCache]: Analyzing trace with hash 975501734, now seen corresponding path program 1 times [2025-04-29 11:15:59,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:59,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645531275] [2025-04-29 11:15:59,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:59,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:59,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:15:59,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:15:59,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:59,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:15:59,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:15:59,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:15:59,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645531275] [2025-04-29 11:15:59,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645531275] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:15:59,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:15:59,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:15:59,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595230105] [2025-04-29 11:15:59,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:15:59,749 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:15:59,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:15:59,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:15:59,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:15:59,853 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2025-04-29 11:15:59,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 63 transitions, 190 flow. Second operand has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 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-04-29 11:15:59,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:15:59,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2025-04-29 11:15:59,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:15:59,942 INFO L116 PetriNetUnfolderBase]: 64/264 cut-off events. [2025-04-29 11:15:59,943 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-29 11:15:59,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 264 events. 64/264 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1278 event pairs, 63 based on Foata normal form. 2/215 useless extension candidates. Maximal degree in co-relation 401. Up to 150 conditions per place. [2025-04-29 11:15:59,945 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 22 selfloop transitions, 11 changer transitions 0/62 dead transitions. [2025-04-29 11:15:59,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 62 transitions, 254 flow [2025-04-29 11:15:59,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:15:59,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:15:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2025-04-29 11:15:59,946 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6169014084507042 [2025-04-29 11:15:59,947 INFO L175 Difference]: Start difference. First operand has 70 places, 63 transitions, 190 flow. Second operand 5 states and 219 transitions. [2025-04-29 11:15:59,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 62 transitions, 254 flow [2025-04-29 11:15:59,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 62 transitions, 232 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-29 11:15:59,948 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 188 flow [2025-04-29 11:15:59,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2025-04-29 11:15:59,949 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2025-04-29 11:15:59,949 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 188 flow [2025-04-29 11:15:59,949 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 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-04-29 11:15:59,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:15:59,949 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:15:59,949 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:15:59,949 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:15:59,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:15:59,950 INFO L85 PathProgramCache]: Analyzing trace with hash 975501735, now seen corresponding path program 1 times [2025-04-29 11:15:59,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:15:59,950 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039469407] [2025-04-29 11:15:59,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:15:59,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:15:59,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:15:59,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:15:59,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:15:59,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:00,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:00,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:00,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039469407] [2025-04-29 11:16:00,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039469407] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:00,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:00,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:16:00,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765200150] [2025-04-29 11:16:00,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:00,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:16:00,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:00,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:16:00,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:16:00,182 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 71 [2025-04-29 11:16:00,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 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-04-29 11:16:00,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:00,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 71 [2025-04-29 11:16:00,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:00,259 INFO L116 PetriNetUnfolderBase]: 64/262 cut-off events. [2025-04-29 11:16:00,259 INFO L117 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-04-29 11:16:00,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 262 events. 64/262 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1275 event pairs, 63 based on Foata normal form. 2/213 useless extension candidates. Maximal degree in co-relation 399. Up to 150 conditions per place. [2025-04-29 11:16:00,260 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 20 selfloop transitions, 11 changer transitions 0/61 dead transitions. [2025-04-29 11:16:00,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 61 transitions, 248 flow [2025-04-29 11:16:00,261 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:16:00,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:16:00,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2025-04-29 11:16:00,261 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6394366197183099 [2025-04-29 11:16:00,261 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 188 flow. Second operand 5 states and 227 transitions. [2025-04-29 11:16:00,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 61 transitions, 248 flow [2025-04-29 11:16:00,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 61 transitions, 226 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 11:16:00,263 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 186 flow [2025-04-29 11:16:00,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2025-04-29 11:16:00,263 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -7 predicate places. [2025-04-29 11:16:00,263 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 186 flow [2025-04-29 11:16:00,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 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-04-29 11:16:00,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:00,264 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:00,264 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:16:00,264 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:00,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:00,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1191143498, now seen corresponding path program 1 times [2025-04-29 11:16:00,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:00,265 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639171629] [2025-04-29 11:16:00,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:00,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:00,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:16:00,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:16:00,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:00,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:00,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:00,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:00,537 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639171629] [2025-04-29 11:16:00,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639171629] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:00,537 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143383296] [2025-04-29 11:16:00,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:00,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:00,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:00,540 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-04-29 11:16:00,541 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-04-29 11:16:00,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:16:00,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:16:00,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:00,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:00,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-29 11:16:00,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:00,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:00,706 INFO L354 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 14 treesize of output 9 [2025-04-29 11:16:00,771 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:16:00,771 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-29 11:16:00,787 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:16:00,787 INFO L354 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-04-29 11:16:00,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:00,909 INFO L354 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 14 treesize of output 9 [2025-04-29 11:16:00,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:00,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:01,084 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:01,084 INFO L354 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-04-29 11:16:01,144 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:01,145 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-29 11:16:01,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:01,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143383296] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:01,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:01,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 16 [2025-04-29 11:16:01,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610240500] [2025-04-29 11:16:01,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:01,198 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:16:01,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:01,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:16:01,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:16:02,496 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 71 [2025-04-29 11:16:02,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 186 flow. Second operand has 18 states, 18 states have (on average 35.833333333333336) internal successors, (645), 18 states have internal predecessors, (645), 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-04-29 11:16:02,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:02,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 71 [2025-04-29 11:16:02,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:02,895 INFO L116 PetriNetUnfolderBase]: 93/362 cut-off events. [2025-04-29 11:16:02,895 INFO L117 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-04-29 11:16:02,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 362 events. 93/362 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1881 event pairs, 90 based on Foata normal form. 3/291 useless extension candidates. Maximal degree in co-relation 528. Up to 209 conditions per place. [2025-04-29 11:16:02,896 INFO L140 encePairwiseOnDemand]: 60/71 looper letters, 45 selfloop transitions, 16 changer transitions 0/84 dead transitions. [2025-04-29 11:16:02,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 84 transitions, 420 flow [2025-04-29 11:16:02,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:16:02,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:16:02,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 376 transitions. [2025-04-29 11:16:02,898 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5884194053208138 [2025-04-29 11:16:02,898 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 186 flow. Second operand 9 states and 376 transitions. [2025-04-29 11:16:02,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 84 transitions, 420 flow [2025-04-29 11:16:02,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 84 transitions, 366 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 11:16:02,900 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 272 flow [2025-04-29 11:16:02,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=272, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2025-04-29 11:16:02,901 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 1 predicate places. [2025-04-29 11:16:02,901 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 272 flow [2025-04-29 11:16:02,901 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 35.833333333333336) internal successors, (645), 18 states have internal predecessors, (645), 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-04-29 11:16:02,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:02,901 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2025-04-29 11:16:02,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:16:03,106 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:03,106 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:03,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:03,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2043237027, now seen corresponding path program 1 times [2025-04-29 11:16:03,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:03,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839050334] [2025-04-29 11:16:03,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:03,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:03,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:16:03,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:16:03,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:03,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:03,218 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:16:03,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:03,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839050334] [2025-04-29 11:16:03,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839050334] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:03,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:03,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:16:03,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17627879] [2025-04-29 11:16:03,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:03,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:16:03,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:03,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:16:03,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:16:03,279 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2025-04-29 11:16:03,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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-04-29 11:16:03,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:03,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2025-04-29 11:16:03,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:03,341 INFO L116 PetriNetUnfolderBase]: 75/305 cut-off events. [2025-04-29 11:16:03,341 INFO L117 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-04-29 11:16:03,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 305 events. 75/305 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1451 event pairs, 72 based on Foata normal form. 5/265 useless extension candidates. Maximal degree in co-relation 523. Up to 206 conditions per place. [2025-04-29 11:16:03,342 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 42 selfloop transitions, 1 changer transitions 0/65 dead transitions. [2025-04-29 11:16:03,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 65 transitions, 342 flow [2025-04-29 11:16:03,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:03,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:03,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2025-04-29 11:16:03,343 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6901408450704225 [2025-04-29 11:16:03,343 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 272 flow. Second operand 3 states and 147 transitions. [2025-04-29 11:16:03,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 65 transitions, 342 flow [2025-04-29 11:16:03,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 65 transitions, 322 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-29 11:16:03,349 INFO L231 Difference]: Finished difference. Result has 70 places, 65 transitions, 238 flow [2025-04-29 11:16:03,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=70, PETRI_TRANSITIONS=65} [2025-04-29 11:16:03,350 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2025-04-29 11:16:03,350 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 238 flow [2025-04-29 11:16:03,351 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 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-04-29 11:16:03,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:03,351 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:03,351 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:16:03,352 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:03,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:03,352 INFO L85 PathProgramCache]: Analyzing trace with hash -682630337, now seen corresponding path program 1 times [2025-04-29 11:16:03,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:03,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050101495] [2025-04-29 11:16:03,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:03,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:03,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:16:03,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:16:03,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:03,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:03,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:16:03,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:03,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050101495] [2025-04-29 11:16:03,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050101495] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:03,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:03,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:16:03,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550092543] [2025-04-29 11:16:03,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:03,464 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:03,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:03,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:03,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:03,496 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 71 [2025-04-29 11:16:03,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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-04-29 11:16:03,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:03,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 71 [2025-04-29 11:16:03,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:03,561 INFO L116 PetriNetUnfolderBase]: 73/288 cut-off events. [2025-04-29 11:16:03,561 INFO L117 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-04-29 11:16:03,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 288 events. 73/288 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1313 event pairs, 56 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 544. Up to 164 conditions per place. [2025-04-29 11:16:03,562 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 46 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2025-04-29 11:16:03,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 344 flow [2025-04-29 11:16:03,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:03,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:03,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2025-04-29 11:16:03,564 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7605633802816901 [2025-04-29 11:16:03,564 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 238 flow. Second operand 3 states and 162 transitions. [2025-04-29 11:16:03,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 344 flow [2025-04-29 11:16:03,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 70 transitions, 343 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:16:03,566 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 237 flow [2025-04-29 11:16:03,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2025-04-29 11:16:03,567 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2025-04-29 11:16:03,567 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 237 flow [2025-04-29 11:16:03,568 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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-04-29 11:16:03,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:03,568 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:03,569 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:16:03,569 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:03,569 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:03,569 INFO L85 PathProgramCache]: Analyzing trace with hash -682630336, now seen corresponding path program 1 times [2025-04-29 11:16:03,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:03,569 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154090486] [2025-04-29 11:16:03,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:03,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:03,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:16:03,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:16:03,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:03,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:03,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:03,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154090486] [2025-04-29 11:16:03,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154090486] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:03,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26188190] [2025-04-29 11:16:03,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:03,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:03,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:03,655 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-04-29 11:16:03,657 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-04-29 11:16:03,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:16:03,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:16:03,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:03,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:03,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:16:03,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:03,811 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:03,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:03,850 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:03,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26188190] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:03,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:03,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-04-29 11:16:03,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428930323] [2025-04-29 11:16:03,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:03,851 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:16:03,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:03,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:16:03,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:16:03,864 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2025-04-29 11:16:03,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 237 flow. Second operand has 9 states, 9 states have (on average 49.888888888888886) internal successors, (449), 9 states have internal predecessors, (449), 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-04-29 11:16:03,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:03,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2025-04-29 11:16:03,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:03,998 INFO L116 PetriNetUnfolderBase]: 64/286 cut-off events. [2025-04-29 11:16:03,999 INFO L117 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2025-04-29 11:16:03,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 286 events. 64/286 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1040 event pairs, 63 based on Foata normal form. 4/256 useless extension candidates. Maximal degree in co-relation 570. Up to 146 conditions per place. [2025-04-29 11:16:04,000 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 54 selfloop transitions, 8 changer transitions 0/85 dead transitions. [2025-04-29 11:16:04,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 85 transitions, 457 flow [2025-04-29 11:16:04,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:16:04,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:16:04,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 426 transitions. [2025-04-29 11:16:04,002 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-04-29 11:16:04,002 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 237 flow. Second operand 8 states and 426 transitions. [2025-04-29 11:16:04,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 85 transitions, 457 flow [2025-04-29 11:16:04,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 85 transitions, 453 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:16:04,003 INFO L231 Difference]: Finished difference. Result has 77 places, 64 transitions, 269 flow [2025-04-29 11:16:04,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=269, PETRI_PLACES=77, PETRI_TRANSITIONS=64} [2025-04-29 11:16:04,004 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 4 predicate places. [2025-04-29 11:16:04,004 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 64 transitions, 269 flow [2025-04-29 11:16:04,004 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 49.888888888888886) internal successors, (449), 9 states have internal predecessors, (449), 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-04-29 11:16:04,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:04,004 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1] [2025-04-29 11:16:04,011 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-04-29 11:16:04,205 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-29 11:16:04,205 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:04,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:04,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1720687750, now seen corresponding path program 2 times [2025-04-29 11:16:04,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:04,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956849251] [2025-04-29 11:16:04,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:16:04,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:04,241 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-29 11:16:04,365 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:16:04,365 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:16:04,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:05,783 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:05,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:05,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956849251] [2025-04-29 11:16:05,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956849251] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:05,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133074340] [2025-04-29 11:16:05,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:16:05,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:05,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:05,785 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-04-29 11:16:05,787 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-04-29 11:16:05,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-29 11:16:05,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:16:05,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:16:05,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:05,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-04-29 11:16:06,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:06,049 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:16:06,049 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-29 11:16:06,064 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:16:06,064 INFO L354 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-04-29 11:16:06,124 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 11:16:06,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:06,129 INFO L354 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 14 treesize of output 9 [2025-04-29 11:16:06,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:06,228 INFO L354 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 14 treesize of output 9 [2025-04-29 11:16:06,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:06,268 INFO L354 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 14 treesize of output 9 [2025-04-29 11:16:06,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:06,334 INFO L354 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 14 treesize of output 9 [2025-04-29 11:16:06,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:06,385 INFO L354 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 14 treesize of output 9 [2025-04-29 11:16:06,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:06,449 INFO L354 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 14 treesize of output 9 [2025-04-29 11:16:06,498 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:16:06,498 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-04-29 11:16:06,510 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:16:06,510 INFO L354 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-04-29 11:16:06,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:16:06,626 INFO L354 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 14 treesize of output 9 [2025-04-29 11:16:06,653 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:06,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:06,822 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:06,822 INFO L354 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-04-29 11:16:06,881 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:06,881 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-29 11:16:07,038 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:07,039 INFO L354 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-04-29 11:16:07,087 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:07,088 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-29 11:16:07,243 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:07,243 INFO L354 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-04-29 11:16:07,316 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:07,317 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-29 11:16:07,486 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:16:07,486 INFO L354 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-04-29 11:16:07,555 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 11:16:07,555 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-04-29 11:16:07,616 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:07,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133074340] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:07,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:07,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 10] total 43 [2025-04-29 11:16:07,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539068405] [2025-04-29 11:16:07,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:07,617 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-29 11:16:07,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:07,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-29 11:16:07,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=1669, Unknown=0, NotChecked=0, Total=1980 [2025-04-29 11:16:13,506 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 71 [2025-04-29 11:16:13,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 64 transitions, 269 flow. Second operand has 45 states, 45 states have (on average 36.13333333333333) internal successors, (1626), 45 states have internal predecessors, (1626), 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-04-29 11:16:13,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:13,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 71 [2025-04-29 11:16:13,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:14,552 INFO L116 PetriNetUnfolderBase]: 77/359 cut-off events. [2025-04-29 11:16:14,552 INFO L117 PetriNetUnfolderBase]: For 263/263 co-relation queries the response was YES. [2025-04-29 11:16:14,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 797 conditions, 359 events. 77/359 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1357 event pairs, 72 based on Foata normal form. 6/328 useless extension candidates. Maximal degree in co-relation 778. Up to 172 conditions per place. [2025-04-29 11:16:14,553 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 66 selfloop transitions, 32 changer transitions 0/119 dead transitions. [2025-04-29 11:16:14,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 119 transitions, 799 flow [2025-04-29 11:16:14,554 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 11:16:14,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-29 11:16:14,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 716 transitions. [2025-04-29 11:16:14,556 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5602503912363067 [2025-04-29 11:16:14,556 INFO L175 Difference]: Start difference. First operand has 77 places, 64 transitions, 269 flow. Second operand 18 states and 716 transitions. [2025-04-29 11:16:14,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 119 transitions, 799 flow [2025-04-29 11:16:14,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 119 transitions, 783 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-29 11:16:14,558 INFO L231 Difference]: Finished difference. Result has 101 places, 84 transitions, 569 flow [2025-04-29 11:16:14,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=569, PETRI_PLACES=101, PETRI_TRANSITIONS=84} [2025-04-29 11:16:14,559 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 28 predicate places. [2025-04-29 11:16:14,559 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 84 transitions, 569 flow [2025-04-29 11:16:14,559 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 36.13333333333333) internal successors, (1626), 45 states have internal predecessors, (1626), 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-04-29 11:16:14,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:14,560 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:14,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:16:14,760 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:14,760 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:14,761 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:14,761 INFO L85 PathProgramCache]: Analyzing trace with hash 2035632528, now seen corresponding path program 2 times [2025-04-29 11:16:14,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:14,761 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349626024] [2025-04-29 11:16:14,761 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:16:14,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:14,793 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-04-29 11:16:14,794 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 67 statements. [2025-04-29 11:16:14,794 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:16:14,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-04-29 11:16:14,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:14,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349626024] [2025-04-29 11:16:14,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349626024] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:16:14,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:16:14,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:16:14,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490139918] [2025-04-29 11:16:14,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:16:14,813 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:16:14,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:14,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:16:14,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:16:14,847 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 71 [2025-04-29 11:16:14,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 84 transitions, 569 flow. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 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-04-29 11:16:14,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:14,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 71 [2025-04-29 11:16:14,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:14,921 INFO L116 PetriNetUnfolderBase]: 68/327 cut-off events. [2025-04-29 11:16:14,921 INFO L117 PetriNetUnfolderBase]: For 573/573 co-relation queries the response was YES. [2025-04-29 11:16:14,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 850 conditions, 327 events. 68/327 cut-off events. For 573/573 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1137 event pairs, 56 based on Foata normal form. 8/306 useless extension candidates. Maximal degree in co-relation 820. Up to 208 conditions per place. [2025-04-29 11:16:14,923 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 66 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2025-04-29 11:16:14,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 89 transitions, 715 flow [2025-04-29 11:16:14,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:16:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:16:14,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2025-04-29 11:16:14,924 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7699530516431925 [2025-04-29 11:16:14,924 INFO L175 Difference]: Start difference. First operand has 101 places, 84 transitions, 569 flow. Second operand 3 states and 164 transitions. [2025-04-29 11:16:14,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 89 transitions, 715 flow [2025-04-29 11:16:14,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 89 transitions, 605 flow, removed 39 selfloop flow, removed 8 redundant places. [2025-04-29 11:16:14,930 INFO L231 Difference]: Finished difference. Result has 93 places, 82 transitions, 459 flow [2025-04-29 11:16:14,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=459, PETRI_PLACES=93, PETRI_TRANSITIONS=82} [2025-04-29 11:16:14,930 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 20 predicate places. [2025-04-29 11:16:14,930 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 82 transitions, 459 flow [2025-04-29 11:16:14,931 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 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-04-29 11:16:14,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:14,931 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:16:14,931 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:16:14,931 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:14,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:14,931 INFO L85 PathProgramCache]: Analyzing trace with hash 2035265977, now seen corresponding path program 1 times [2025-04-29 11:16:14,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:14,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770357335] [2025-04-29 11:16:14,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:14,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:14,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:16:14,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:16:14,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:14,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:15,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:15,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770357335] [2025-04-29 11:16:15,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770357335] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:15,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984959987] [2025-04-29 11:16:15,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:16:15,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:15,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:15,168 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-04-29 11:16:15,170 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-04-29 11:16:15,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 11:16:15,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 11:16:15,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:16:15,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:15,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:16:15,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:16:15,487 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:15,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:16:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:15,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984959987] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:16:15,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:16:15,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-04-29 11:16:15,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841657144] [2025-04-29 11:16:15,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:16:15,581 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:16:15,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:16:15,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:16:15,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:16:15,600 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2025-04-29 11:16:15,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 82 transitions, 459 flow. Second operand has 13 states, 13 states have (on average 51.0) internal successors, (663), 13 states have internal predecessors, (663), 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-04-29 11:16:15,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:16:15,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2025-04-29 11:16:15,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:16:15,750 INFO L116 PetriNetUnfolderBase]: 64/320 cut-off events. [2025-04-29 11:16:15,751 INFO L117 PetriNetUnfolderBase]: For 410/410 co-relation queries the response was YES. [2025-04-29 11:16:15,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 320 events. 64/320 cut-off events. For 410/410 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 988 event pairs, 63 based on Foata normal form. 4/294 useless extension candidates. Maximal degree in co-relation 747. Up to 146 conditions per place. [2025-04-29 11:16:15,752 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 79 selfloop transitions, 12 changer transitions 0/112 dead transitions. [2025-04-29 11:16:15,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 112 transitions, 797 flow [2025-04-29 11:16:15,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:16:15,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:16:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 634 transitions. [2025-04-29 11:16:15,753 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.744131455399061 [2025-04-29 11:16:15,753 INFO L175 Difference]: Start difference. First operand has 93 places, 82 transitions, 459 flow. Second operand 12 states and 634 transitions. [2025-04-29 11:16:15,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 112 transitions, 797 flow [2025-04-29 11:16:15,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 112 transitions, 783 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-29 11:16:15,757 INFO L231 Difference]: Finished difference. Result has 103 places, 79 transitions, 433 flow [2025-04-29 11:16:15,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=433, PETRI_PLACES=103, PETRI_TRANSITIONS=79} [2025-04-29 11:16:15,758 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 30 predicate places. [2025-04-29 11:16:15,758 INFO L485 AbstractCegarLoop]: Abstraction has has 103 places, 79 transitions, 433 flow [2025-04-29 11:16:15,759 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.0) internal successors, (663), 13 states have internal predecessors, (663), 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-04-29 11:16:15,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:16:15,759 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1] [2025-04-29 11:16:15,766 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-04-29 11:16:15,959 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:15,959 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-04-29 11:16:15,960 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:16:15,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1726508546, now seen corresponding path program 3 times [2025-04-29 11:16:15,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:16:15,960 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177584108] [2025-04-29 11:16:15,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:16:15,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:16:16,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 11 equivalence classes. [2025-04-29 11:16:16,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 105 of 105 statements. [2025-04-29 11:16:16,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-29 11:16:16,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:16:16,778 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 399 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:16:16,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:16:16,778 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177584108] [2025-04-29 11:16:16,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177584108] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:16:16,778 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531518591] [2025-04-29 11:16:16,778 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:16:16,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:16:16,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:16:16,780 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-04-29 11:16:16,782 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-04-29 11:16:17,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 11 equivalence classes. Killed by 15