./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 531fb1e21d8f5a9631a3764359a014fcdd0042558e9afceaf1b553fa03cda562 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 19:08:18,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 19:08:18,851 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 19:08:18,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 19:08:18,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 19:08:18,882 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 19:08:18,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 19:08:18,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 19:08:18,883 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 19:08:18,884 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 19:08:18,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 19:08:18,885 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 19:08:18,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 19:08:18,886 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 19:08:18,886 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 19:08:18,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 19:08:18,888 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 19:08:18,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 19:08:18,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 19:08:18,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 19:08:18,889 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 19:08:18,890 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 19:08:18,890 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 19:08:18,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 19:08:18,892 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 19:08:18,893 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 19:08:18,893 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 19:08:18,893 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 19:08:18,893 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 19:08:18,893 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 19:08:18,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 19:08:18,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 19:08:18,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 19:08:18,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:08:18,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 19:08:18,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 19:08:18,894 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 19:08:18,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 19:08:18,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 19:08:18,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 19:08:18,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 19:08:18,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 19:08:18,896 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 531fb1e21d8f5a9631a3764359a014fcdd0042558e9afceaf1b553fa03cda562 [2024-10-24 19:08:19,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 19:08:19,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 19:08:19,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 19:08:19,223 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 19:08:19,223 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 19:08:19,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.i [2024-10-24 19:08:20,581 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 19:08:20,984 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 19:08:20,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.i [2024-10-24 19:08:21,021 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/207f5c981/ef108102aa4346ffa7e19aa2786bcde7/FLAGe2f162776 [2024-10-24 19:08:21,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/207f5c981/ef108102aa4346ffa7e19aa2786bcde7 [2024-10-24 19:08:21,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 19:08:21,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 19:08:21,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 19:08:21,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 19:08:21,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 19:08:21,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:08:21" (1/1) ... [2024-10-24 19:08:21,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@539d4b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:21, skipping insertion in model container [2024-10-24 19:08:21,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:08:21" (1/1) ... [2024-10-24 19:08:21,237 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 19:08:22,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:08:22,122 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 19:08:22,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 19:08:22,392 INFO L204 MainTranslator]: Completed translation [2024-10-24 19:08:22,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:22 WrapperNode [2024-10-24 19:08:22,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 19:08:22,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 19:08:22,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 19:08:22,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 19:08:22,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:22" (1/1) ... [2024-10-24 19:08:22,434 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:22" (1/1) ... [2024-10-24 19:08:22,460 INFO L138 Inliner]: procedures = 371, calls = 33, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 115 [2024-10-24 19:08:22,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 19:08:22,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 19:08:22,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 19:08:22,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 19:08:22,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:22" (1/1) ... [2024-10-24 19:08:22,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:22" (1/1) ... [2024-10-24 19:08:22,475 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:22" (1/1) ... [2024-10-24 19:08:22,500 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [5, 5, 14]. 58 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [5, 0, 0]. The 12 writes are split as follows [0, 2, 10]. [2024-10-24 19:08:22,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:22" (1/1) ... [2024-10-24 19:08:22,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:22" (1/1) ... [2024-10-24 19:08:22,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:22" (1/1) ... [2024-10-24 19:08:22,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:22" (1/1) ... [2024-10-24 19:08:22,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:22" (1/1) ... [2024-10-24 19:08:22,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:22" (1/1) ... [2024-10-24 19:08:22,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 19:08:22,517 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 19:08:22,517 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 19:08:22,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 19:08:22,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:22" (1/1) ... [2024-10-24 19:08:22,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 19:08:22,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 19:08:22,550 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 19:08:22,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 19:08:22,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 19:08:22,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 19:08:22,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 19:08:22,604 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-24 19:08:22,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 19:08:22,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 19:08:22,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 19:08:22,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 19:08:22,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 19:08:22,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 19:08:22,604 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-24 19:08:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 19:08:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 19:08:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 19:08:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 19:08:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 19:08:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-24 19:08:22,605 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-24 19:08:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 19:08:22,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 19:08:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 19:08:22,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 19:08:22,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 19:08:22,607 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 19:08:22,745 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 19:08:22,747 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 19:08:23,002 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 19:08:23,003 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 19:08:23,147 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 19:08:23,148 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 19:08:23,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:08:23 BoogieIcfgContainer [2024-10-24 19:08:23,150 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 19:08:23,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 19:08:23,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 19:08:23,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 19:08:23,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:08:21" (1/3) ... [2024-10-24 19:08:23,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3b00a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:08:23, skipping insertion in model container [2024-10-24 19:08:23,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:08:22" (2/3) ... [2024-10-24 19:08:23,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3b00a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:08:23, skipping insertion in model container [2024-10-24 19:08:23,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:08:23" (3/3) ... [2024-10-24 19:08:23,157 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_09-arraylist-deref.i [2024-10-24 19:08:23,171 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 19:08:23,171 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-10-24 19:08:23,171 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 19:08:23,217 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-24 19:08:23,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 69 transitions, 142 flow [2024-10-24 19:08:23,283 INFO L124 PetriNetUnfolderBase]: 0/68 cut-off events. [2024-10-24 19:08:23,285 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:08:23,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 68 events. 0/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 164 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-10-24 19:08:23,287 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 69 transitions, 142 flow [2024-10-24 19:08:23,290 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 68 transitions, 139 flow [2024-10-24 19:08:23,298 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 19:08:23,305 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7d87d739, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 19:08:23,306 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-10-24 19:08:23,309 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 19:08:23,309 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2024-10-24 19:08:23,309 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:08:23,309 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:23,310 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-10-24 19:08:23,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 19:08:23,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:23,314 INFO L85 PathProgramCache]: Analyzing trace with hash 12073, now seen corresponding path program 1 times [2024-10-24 19:08:23,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:23,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677245216] [2024-10-24 19:08:23,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:23,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:23,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:08:23,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:23,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677245216] [2024-10-24 19:08:23,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677245216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:23,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:23,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 19:08:23,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508828381] [2024-10-24 19:08:23,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:23,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:08:23,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:23,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:08:23,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:08:23,708 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 69 [2024-10-24 19:08:23,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 68 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:23,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:23,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 69 [2024-10-24 19:08:23,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:23,788 INFO L124 PetriNetUnfolderBase]: 63/260 cut-off events. [2024-10-24 19:08:23,788 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 19:08:23,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 260 events. 63/260 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1223 event pairs, 63 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 377. Up to 149 conditions per place. [2024-10-24 19:08:23,792 INFO L140 encePairwiseOnDemand]: 61/69 looper letters, 22 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2024-10-24 19:08:23,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 183 flow [2024-10-24 19:08:23,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:08:23,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:08:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2024-10-24 19:08:23,803 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7101449275362319 [2024-10-24 19:08:23,804 INFO L175 Difference]: Start difference. First operand has 72 places, 68 transitions, 139 flow. Second operand 3 states and 147 transitions. [2024-10-24 19:08:23,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 183 flow [2024-10-24 19:08:23,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 64 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 19:08:23,810 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 138 flow [2024-10-24 19:08:23,814 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2024-10-24 19:08:23,817 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2024-10-24 19:08:23,817 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 138 flow [2024-10-24 19:08:23,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:23,818 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:23,818 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-10-24 19:08:23,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 19:08:23,819 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 19:08:23,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:23,819 INFO L85 PathProgramCache]: Analyzing trace with hash 12074, now seen corresponding path program 1 times [2024-10-24 19:08:23,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:23,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492054613] [2024-10-24 19:08:23,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:23,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:23,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:08:23,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:23,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492054613] [2024-10-24 19:08:23,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492054613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:23,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:23,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 19:08:23,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065614282] [2024-10-24 19:08:23,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:23,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:08:23,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:23,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:08:23,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:08:24,008 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 69 [2024-10-24 19:08:24,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:24,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:24,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 69 [2024-10-24 19:08:24,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:24,125 INFO L124 PetriNetUnfolderBase]: 63/256 cut-off events. [2024-10-24 19:08:24,126 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-24 19:08:24,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 256 events. 63/256 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1205 event pairs, 63 based on Foata normal form. 4/205 useless extension candidates. Maximal degree in co-relation 396. Up to 149 conditions per place. [2024-10-24 19:08:24,132 INFO L140 encePairwiseOnDemand]: 61/69 looper letters, 20 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2024-10-24 19:08:24,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 60 transitions, 178 flow [2024-10-24 19:08:24,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:08:24,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:08:24,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2024-10-24 19:08:24,133 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7294685990338164 [2024-10-24 19:08:24,133 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 138 flow. Second operand 3 states and 151 transitions. [2024-10-24 19:08:24,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 60 transitions, 178 flow [2024-10-24 19:08:24,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 60 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:08:24,135 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 130 flow [2024-10-24 19:08:24,135 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2024-10-24 19:08:24,135 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -7 predicate places. [2024-10-24 19:08:24,136 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 130 flow [2024-10-24 19:08:24,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:24,136 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:24,136 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-24 19:08:24,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 19:08:24,140 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 19:08:24,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:24,141 INFO L85 PathProgramCache]: Analyzing trace with hash 11612461, now seen corresponding path program 1 times [2024-10-24 19:08:24,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:24,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031515626] [2024-10-24 19:08:24,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:24,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:24,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:08:24,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:24,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031515626] [2024-10-24 19:08:24,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031515626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:24,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:24,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:08:24,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903154064] [2024-10-24 19:08:24,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:24,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:08:24,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:24,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:08:24,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:08:24,344 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 69 [2024-10-24 19:08:24,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:24,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:24,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 69 [2024-10-24 19:08:24,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:24,437 INFO L124 PetriNetUnfolderBase]: 72/274 cut-off events. [2024-10-24 19:08:24,438 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-24 19:08:24,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 274 events. 72/274 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1285 event pairs, 72 based on Foata normal form. 1/226 useless extension candidates. Maximal degree in co-relation 434. Up to 168 conditions per place. [2024-10-24 19:08:24,439 INFO L140 encePairwiseOnDemand]: 63/69 looper letters, 23 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2024-10-24 19:08:24,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 172 flow [2024-10-24 19:08:24,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:08:24,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:08:24,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2024-10-24 19:08:24,441 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6847826086956522 [2024-10-24 19:08:24,442 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 130 flow. Second operand 4 states and 189 transitions. [2024-10-24 19:08:24,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 172 flow [2024-10-24 19:08:24,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 56 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:08:24,443 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 118 flow [2024-10-24 19:08:24,443 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2024-10-24 19:08:24,444 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2024-10-24 19:08:24,444 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 118 flow [2024-10-24 19:08:24,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:24,444 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:24,444 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-24 19:08:24,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 19:08:24,445 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 19:08:24,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:24,445 INFO L85 PathProgramCache]: Analyzing trace with hash 11612462, now seen corresponding path program 1 times [2024-10-24 19:08:24,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:24,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413397850] [2024-10-24 19:08:24,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:24,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:08:24,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:24,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413397850] [2024-10-24 19:08:24,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413397850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:24,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:24,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:08:24,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509162797] [2024-10-24 19:08:24,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:24,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 19:08:24,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:24,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 19:08:24,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 19:08:24,661 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 69 [2024-10-24 19:08:24,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:24,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:24,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 69 [2024-10-24 19:08:24,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:24,757 INFO L124 PetriNetUnfolderBase]: 69/291 cut-off events. [2024-10-24 19:08:24,758 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-24 19:08:24,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 291 events. 69/291 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1512 event pairs, 24 based on Foata normal form. 3/231 useless extension candidates. Maximal degree in co-relation 451. Up to 124 conditions per place. [2024-10-24 19:08:24,760 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 31 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2024-10-24 19:08:24,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 204 flow [2024-10-24 19:08:24,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 19:08:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 19:08:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 206 transitions. [2024-10-24 19:08:24,765 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7463768115942029 [2024-10-24 19:08:24,765 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 118 flow. Second operand 4 states and 206 transitions. [2024-10-24 19:08:24,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 204 flow [2024-10-24 19:08:24,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 64 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:08:24,769 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 132 flow [2024-10-24 19:08:24,770 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2024-10-24 19:08:24,771 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2024-10-24 19:08:24,771 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 132 flow [2024-10-24 19:08:24,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:24,772 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:24,772 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:24,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 19:08:24,772 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 19:08:24,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:24,773 INFO L85 PathProgramCache]: Analyzing trace with hash -169402924, now seen corresponding path program 1 times [2024-10-24 19:08:24,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:24,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961346847] [2024-10-24 19:08:24,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:24,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:25,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:08:25,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:25,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961346847] [2024-10-24 19:08:25,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961346847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:25,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:25,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:08:25,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636703333] [2024-10-24 19:08:25,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:25,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 19:08:25,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:25,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 19:08:25,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 19:08:25,432 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 69 [2024-10-24 19:08:25,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 132 flow. Second operand has 7 states, 7 states have (on average 38.142857142857146) internal successors, (267), 7 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:25,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:25,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 69 [2024-10-24 19:08:25,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:25,546 INFO L124 PetriNetUnfolderBase]: 63/241 cut-off events. [2024-10-24 19:08:25,546 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-24 19:08:25,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 241 events. 63/241 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1113 event pairs, 54 based on Foata normal form. 1/201 useless extension candidates. Maximal degree in co-relation 418. Up to 126 conditions per place. [2024-10-24 19:08:25,548 INFO L140 encePairwiseOnDemand]: 60/69 looper letters, 25 selfloop transitions, 8 changer transitions 3/62 dead transitions. [2024-10-24 19:08:25,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 216 flow [2024-10-24 19:08:25,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 19:08:25,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-24 19:08:25,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 296 transitions. [2024-10-24 19:08:25,549 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6128364389233955 [2024-10-24 19:08:25,550 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 132 flow. Second operand 7 states and 296 transitions. [2024-10-24 19:08:25,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 216 flow [2024-10-24 19:08:25,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 211 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:08:25,551 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 139 flow [2024-10-24 19:08:25,551 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=139, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2024-10-24 19:08:25,552 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2024-10-24 19:08:25,552 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 139 flow [2024-10-24 19:08:25,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.142857142857146) internal successors, (267), 7 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:25,552 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:25,552 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:25,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 19:08:25,553 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 19:08:25,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:25,553 INFO L85 PathProgramCache]: Analyzing trace with hash -169402925, now seen corresponding path program 1 times [2024-10-24 19:08:25,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:25,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312916749] [2024-10-24 19:08:25,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:25,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:08:25,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:25,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312916749] [2024-10-24 19:08:25,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312916749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:25,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:25,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:08:25,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770913809] [2024-10-24 19:08:25,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:25,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 19:08:25,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:25,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 19:08:25,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 19:08:25,909 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 69 [2024-10-24 19:08:25,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 139 flow. Second operand has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 7 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:25,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:25,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 69 [2024-10-24 19:08:25,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:26,042 INFO L124 PetriNetUnfolderBase]: 63/239 cut-off events. [2024-10-24 19:08:26,042 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-24 19:08:26,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 239 events. 63/239 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1106 event pairs, 54 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 421. Up to 126 conditions per place. [2024-10-24 19:08:26,043 INFO L140 encePairwiseOnDemand]: 60/69 looper letters, 26 selfloop transitions, 8 changer transitions 3/60 dead transitions. [2024-10-24 19:08:26,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 60 transitions, 225 flow [2024-10-24 19:08:26,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 19:08:26,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-24 19:08:26,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 290 transitions. [2024-10-24 19:08:26,044 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6004140786749482 [2024-10-24 19:08:26,044 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 139 flow. Second operand 7 states and 290 transitions. [2024-10-24 19:08:26,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 60 transitions, 225 flow [2024-10-24 19:08:26,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 60 transitions, 209 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-24 19:08:26,047 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 135 flow [2024-10-24 19:08:26,047 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=135, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2024-10-24 19:08:26,048 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2024-10-24 19:08:26,048 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 135 flow [2024-10-24 19:08:26,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.142857142857146) internal successors, (260), 7 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:26,049 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:26,049 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:26,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 19:08:26,049 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 19:08:26,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:26,050 INFO L85 PathProgramCache]: Analyzing trace with hash 412560121, now seen corresponding path program 1 times [2024-10-24 19:08:26,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:26,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114928176] [2024-10-24 19:08:26,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:26,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:08:26,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:26,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114928176] [2024-10-24 19:08:26,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114928176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:26,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:26,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:08:26,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121555776] [2024-10-24 19:08:26,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:26,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:08:26,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:26,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:08:26,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:08:26,300 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 69 [2024-10-24 19:08:26,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:26,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:26,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 69 [2024-10-24 19:08:26,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:26,380 INFO L124 PetriNetUnfolderBase]: 63/238 cut-off events. [2024-10-24 19:08:26,381 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-10-24 19:08:26,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 238 events. 63/238 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1099 event pairs, 62 based on Foata normal form. 1/200 useless extension candidates. Maximal degree in co-relation 418. Up to 146 conditions per place. [2024-10-24 19:08:26,382 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 20 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2024-10-24 19:08:26,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 51 transitions, 185 flow [2024-10-24 19:08:26,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:08:26,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:08:26,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2024-10-24 19:08:26,383 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2024-10-24 19:08:26,383 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 135 flow. Second operand 5 states and 225 transitions. [2024-10-24 19:08:26,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 51 transitions, 185 flow [2024-10-24 19:08:26,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 169 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-24 19:08:26,385 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 129 flow [2024-10-24 19:08:26,385 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2024-10-24 19:08:26,385 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2024-10-24 19:08:26,385 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 129 flow [2024-10-24 19:08:26,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 5 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:26,386 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:26,386 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:26,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 19:08:26,386 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 19:08:26,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:26,387 INFO L85 PathProgramCache]: Analyzing trace with hash 412560120, now seen corresponding path program 1 times [2024-10-24 19:08:26,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:26,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432052799] [2024-10-24 19:08:26,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:26,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:08:26,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:26,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432052799] [2024-10-24 19:08:26,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432052799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:26,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:26,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 19:08:26,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186920409] [2024-10-24 19:08:26,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:26,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 19:08:26,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:26,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 19:08:26,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 19:08:26,553 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 69 [2024-10-24 19:08:26,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:26,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:26,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 69 [2024-10-24 19:08:26,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:26,630 INFO L124 PetriNetUnfolderBase]: 63/237 cut-off events. [2024-10-24 19:08:26,630 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-24 19:08:26,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 237 events. 63/237 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1102 event pairs, 62 based on Foata normal form. 1/199 useless extension candidates. Maximal degree in co-relation 408. Up to 146 conditions per place. [2024-10-24 19:08:26,632 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 22 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2024-10-24 19:08:26,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 50 transitions, 183 flow [2024-10-24 19:08:26,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:08:26,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:08:26,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 217 transitions. [2024-10-24 19:08:26,633 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6289855072463768 [2024-10-24 19:08:26,633 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 129 flow. Second operand 5 states and 217 transitions. [2024-10-24 19:08:26,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 50 transitions, 183 flow [2024-10-24 19:08:26,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 171 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 19:08:26,639 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 127 flow [2024-10-24 19:08:26,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2024-10-24 19:08:26,640 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -14 predicate places. [2024-10-24 19:08:26,640 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 127 flow [2024-10-24 19:08:26,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:26,640 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:26,640 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:26,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 19:08:26,641 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 19:08:26,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:26,641 INFO L85 PathProgramCache]: Analyzing trace with hash 459360678, now seen corresponding path program 1 times [2024-10-24 19:08:26,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:26,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334786262] [2024-10-24 19:08:26,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:26,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:08:26,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:26,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334786262] [2024-10-24 19:08:26,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334786262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:26,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:26,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:08:26,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699737260] [2024-10-24 19:08:26,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:26,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:08:26,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:26,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:08:26,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:08:26,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 69 [2024-10-24 19:08:26,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:26,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:26,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 69 [2024-10-24 19:08:26,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:26,888 INFO L124 PetriNetUnfolderBase]: 70/253 cut-off events. [2024-10-24 19:08:26,888 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-10-24 19:08:26,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 253 events. 70/253 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1171 event pairs, 51 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 439. Up to 136 conditions per place. [2024-10-24 19:08:26,889 INFO L140 encePairwiseOnDemand]: 65/69 looper letters, 31 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2024-10-24 19:08:26,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 207 flow [2024-10-24 19:08:26,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:08:26,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:08:26,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2024-10-24 19:08:26,890 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7729468599033816 [2024-10-24 19:08:26,890 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 127 flow. Second operand 3 states and 160 transitions. [2024-10-24 19:08:26,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 207 flow [2024-10-24 19:08:26,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 55 transitions, 195 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-24 19:08:26,891 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 117 flow [2024-10-24 19:08:26,892 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2024-10-24 19:08:26,893 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -18 predicate places. [2024-10-24 19:08:26,893 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 117 flow [2024-10-24 19:08:26,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:26,894 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:26,894 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:26,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 19:08:26,894 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 19:08:26,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:26,895 INFO L85 PathProgramCache]: Analyzing trace with hash 459360679, now seen corresponding path program 1 times [2024-10-24 19:08:26,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:26,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210870828] [2024-10-24 19:08:26,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:26,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:08:26,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:26,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210870828] [2024-10-24 19:08:26,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210870828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:26,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:26,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 19:08:26,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585177282] [2024-10-24 19:08:26,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:26,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:08:26,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:26,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:08:26,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:08:27,054 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 69 [2024-10-24 19:08:27,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:27,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:27,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 69 [2024-10-24 19:08:27,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:27,151 INFO L124 PetriNetUnfolderBase]: 63/231 cut-off events. [2024-10-24 19:08:27,151 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-10-24 19:08:27,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 231 events. 63/231 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1033 event pairs, 50 based on Foata normal form. 16/217 useless extension candidates. Maximal degree in co-relation 413. Up to 136 conditions per place. [2024-10-24 19:08:27,152 INFO L140 encePairwiseOnDemand]: 65/69 looper letters, 30 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2024-10-24 19:08:27,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 195 flow [2024-10-24 19:08:27,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:08:27,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:08:27,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2024-10-24 19:08:27,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.782608695652174 [2024-10-24 19:08:27,153 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 117 flow. Second operand 3 states and 162 transitions. [2024-10-24 19:08:27,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 195 flow [2024-10-24 19:08:27,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:08:27,154 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 113 flow [2024-10-24 19:08:27,155 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2024-10-24 19:08:27,155 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -20 predicate places. [2024-10-24 19:08:27,155 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 113 flow [2024-10-24 19:08:27,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:27,155 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:27,156 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:27,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 19:08:27,156 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 19:08:27,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:27,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1300637112, now seen corresponding path program 1 times [2024-10-24 19:08:27,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:27,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921267730] [2024-10-24 19:08:27,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:27,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:27,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:08:27,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:27,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921267730] [2024-10-24 19:08:27,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921267730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:27,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:27,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 19:08:27,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962145945] [2024-10-24 19:08:27,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:27,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 19:08:27,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:27,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 19:08:27,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-24 19:08:27,641 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 69 [2024-10-24 19:08:27,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 113 flow. Second operand has 9 states, 9 states have (on average 41.44444444444444) internal successors, (373), 9 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:27,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:27,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 69 [2024-10-24 19:08:27,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:27,966 INFO L124 PetriNetUnfolderBase]: 72/241 cut-off events. [2024-10-24 19:08:27,967 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-10-24 19:08:27,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 241 events. 72/241 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1044 event pairs, 54 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 446. Up to 125 conditions per place. [2024-10-24 19:08:27,968 INFO L140 encePairwiseOnDemand]: 58/69 looper letters, 31 selfloop transitions, 11 changer transitions 3/62 dead transitions. [2024-10-24 19:08:27,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 243 flow [2024-10-24 19:08:27,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 19:08:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-24 19:08:27,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 405 transitions. [2024-10-24 19:08:27,970 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2024-10-24 19:08:27,970 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 113 flow. Second operand 9 states and 405 transitions. [2024-10-24 19:08:27,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 243 flow [2024-10-24 19:08:27,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 62 transitions, 231 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 19:08:27,972 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 127 flow [2024-10-24 19:08:27,972 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=127, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2024-10-24 19:08:27,973 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -15 predicate places. [2024-10-24 19:08:27,973 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 127 flow [2024-10-24 19:08:27,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 41.44444444444444) internal successors, (373), 9 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:27,974 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:27,975 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:27,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 19:08:27,975 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 19:08:27,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:27,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1300637111, now seen corresponding path program 1 times [2024-10-24 19:08:27,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:27,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131407847] [2024-10-24 19:08:27,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:27,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:28,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:08:28,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:28,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131407847] [2024-10-24 19:08:28,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131407847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:28,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:28,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 19:08:28,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564667427] [2024-10-24 19:08:28,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:28,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 19:08:28,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:28,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 19:08:28,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 19:08:28,244 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 69 [2024-10-24 19:08:28,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 127 flow. Second operand has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:28,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:28,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 69 [2024-10-24 19:08:28,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:28,347 INFO L124 PetriNetUnfolderBase]: 72/231 cut-off events. [2024-10-24 19:08:28,348 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-24 19:08:28,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 231 events. 72/231 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 959 event pairs, 54 based on Foata normal form. 10/217 useless extension candidates. Maximal degree in co-relation 453. Up to 125 conditions per place. [2024-10-24 19:08:28,349 INFO L140 encePairwiseOnDemand]: 62/69 looper letters, 35 selfloop transitions, 7 changer transitions 3/61 dead transitions. [2024-10-24 19:08:28,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 61 transitions, 251 flow [2024-10-24 19:08:28,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 19:08:28,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 19:08:28,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 285 transitions. [2024-10-24 19:08:28,350 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6884057971014492 [2024-10-24 19:08:28,350 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 127 flow. Second operand 6 states and 285 transitions. [2024-10-24 19:08:28,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 61 transitions, 251 flow [2024-10-24 19:08:28,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 229 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-24 19:08:28,351 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 117 flow [2024-10-24 19:08:28,351 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=117, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2024-10-24 19:08:28,351 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -19 predicate places. [2024-10-24 19:08:28,352 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 117 flow [2024-10-24 19:08:28,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.166666666666664) internal successors, (253), 6 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:28,352 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:28,352 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:28,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 19:08:28,352 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 19:08:28,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:28,352 INFO L85 PathProgramCache]: Analyzing trace with hash -936008185, now seen corresponding path program 1 times [2024-10-24 19:08:28,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:28,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687111912] [2024-10-24 19:08:28,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:28,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:08:28,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:28,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687111912] [2024-10-24 19:08:28,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687111912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:28,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:28,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 19:08:28,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454257025] [2024-10-24 19:08:28,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:28,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 19:08:28,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:28,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 19:08:28,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 19:08:28,933 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 69 [2024-10-24 19:08:28,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 117 flow. Second operand has 8 states, 8 states have (on average 40.625) internal successors, (325), 8 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:28,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:28,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 69 [2024-10-24 19:08:28,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:29,035 INFO L124 PetriNetUnfolderBase]: 72/235 cut-off events. [2024-10-24 19:08:29,035 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-10-24 19:08:29,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 235 events. 72/235 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1012 event pairs, 47 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 454. Up to 153 conditions per place. [2024-10-24 19:08:29,037 INFO L140 encePairwiseOnDemand]: 63/69 looper letters, 30 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2024-10-24 19:08:29,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 51 transitions, 209 flow [2024-10-24 19:08:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 19:08:29,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 19:08:29,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 229 transitions. [2024-10-24 19:08:29,038 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.663768115942029 [2024-10-24 19:08:29,038 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 117 flow. Second operand 5 states and 229 transitions. [2024-10-24 19:08:29,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 51 transitions, 209 flow [2024-10-24 19:08:29,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 189 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-24 19:08:29,039 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 111 flow [2024-10-24 19:08:29,039 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2024-10-24 19:08:29,040 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -21 predicate places. [2024-10-24 19:08:29,040 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 111 flow [2024-10-24 19:08:29,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.625) internal successors, (325), 8 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:29,040 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:29,040 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:29,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 19:08:29,040 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 19:08:29,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:29,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1665045169, now seen corresponding path program 1 times [2024-10-24 19:08:29,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:29,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68208154] [2024-10-24 19:08:29,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:29,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:08:29,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:29,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68208154] [2024-10-24 19:08:29,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68208154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:29,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:29,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 19:08:29,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97125550] [2024-10-24 19:08:29,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:29,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 19:08:29,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:29,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 19:08:29,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-24 19:08:30,677 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 69 [2024-10-24 19:08:30,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 111 flow. Second operand has 13 states, 13 states have (on average 30.23076923076923) internal successors, (393), 13 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:30,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:30,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 69 [2024-10-24 19:08:30,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:30,987 INFO L124 PetriNetUnfolderBase]: 123/352 cut-off events. [2024-10-24 19:08:30,987 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-10-24 19:08:30,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 352 events. 123/352 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1594 event pairs, 55 based on Foata normal form. 0/320 useless extension candidates. Maximal degree in co-relation 670. Up to 163 conditions per place. [2024-10-24 19:08:30,989 INFO L140 encePairwiseOnDemand]: 57/69 looper letters, 48 selfloop transitions, 15 changer transitions 0/73 dead transitions. [2024-10-24 19:08:30,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 311 flow [2024-10-24 19:08:30,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 19:08:30,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 19:08:30,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 383 transitions. [2024-10-24 19:08:30,990 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5046113306982872 [2024-10-24 19:08:30,990 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 111 flow. Second operand 11 states and 383 transitions. [2024-10-24 19:08:30,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 311 flow [2024-10-24 19:08:30,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 299 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 19:08:30,991 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 174 flow [2024-10-24 19:08:30,991 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=174, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2024-10-24 19:08:30,992 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2024-10-24 19:08:30,992 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 174 flow [2024-10-24 19:08:30,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 30.23076923076923) internal successors, (393), 13 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:30,992 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:30,992 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:30,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 19:08:30,993 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 19:08:30,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:30,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1665045168, now seen corresponding path program 1 times [2024-10-24 19:08:30,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:30,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501266121] [2024-10-24 19:08:30,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:30,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:08:31,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:31,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501266121] [2024-10-24 19:08:31,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501266121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:31,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:31,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 19:08:31,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366391730] [2024-10-24 19:08:31,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:31,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 19:08:31,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:31,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 19:08:31,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-24 19:08:32,322 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 69 [2024-10-24 19:08:32,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 174 flow. Second operand has 14 states, 14 states have (on average 34.142857142857146) internal successors, (478), 14 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:32,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:32,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 69 [2024-10-24 19:08:32,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:32,649 INFO L124 PetriNetUnfolderBase]: 123/348 cut-off events. [2024-10-24 19:08:32,650 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-10-24 19:08:32,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 348 events. 123/348 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1570 event pairs, 34 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 760. Up to 118 conditions per place. [2024-10-24 19:08:32,652 INFO L140 encePairwiseOnDemand]: 56/69 looper letters, 44 selfloop transitions, 17 changer transitions 0/71 dead transitions. [2024-10-24 19:08:32,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 71 transitions, 345 flow [2024-10-24 19:08:32,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 19:08:32,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-24 19:08:32,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 424 transitions. [2024-10-24 19:08:32,653 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5586297760210803 [2024-10-24 19:08:32,654 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 174 flow. Second operand 11 states and 424 transitions. [2024-10-24 19:08:32,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 71 transitions, 345 flow [2024-10-24 19:08:32,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 71 transitions, 331 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-10-24 19:08:32,655 INFO L231 Difference]: Finished difference. Result has 70 places, 51 transitions, 218 flow [2024-10-24 19:08:32,656 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=218, PETRI_PLACES=70, PETRI_TRANSITIONS=51} [2024-10-24 19:08:32,656 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -2 predicate places. [2024-10-24 19:08:32,656 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 51 transitions, 218 flow [2024-10-24 19:08:32,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 34.142857142857146) internal successors, (478), 14 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:32,657 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:32,657 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:32,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 19:08:32,657 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 19:08:32,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:32,657 INFO L85 PathProgramCache]: Analyzing trace with hash -614962044, now seen corresponding path program 1 times [2024-10-24 19:08:32,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:32,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557158671] [2024-10-24 19:08:32,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:32,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 19:08:32,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 19:08:32,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 19:08:32,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557158671] [2024-10-24 19:08:32,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557158671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 19:08:32,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 19:08:32,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 19:08:32,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858848807] [2024-10-24 19:08:32,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 19:08:32,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 19:08:32,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 19:08:32,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 19:08:32,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 19:08:32,718 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 69 [2024-10-24 19:08:32,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 51 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:32,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 19:08:32,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 69 [2024-10-24 19:08:32,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 19:08:32,767 INFO L124 PetriNetUnfolderBase]: 39/166 cut-off events. [2024-10-24 19:08:32,767 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2024-10-24 19:08:32,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 166 events. 39/166 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 587 event pairs, 15 based on Foata normal form. 9/159 useless extension candidates. Maximal degree in co-relation 397. Up to 67 conditions per place. [2024-10-24 19:08:32,768 INFO L140 encePairwiseOnDemand]: 65/69 looper letters, 30 selfloop transitions, 4 changer transitions 2/56 dead transitions. [2024-10-24 19:08:32,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 56 transitions, 311 flow [2024-10-24 19:08:32,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 19:08:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 19:08:32,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2024-10-24 19:08:32,769 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8019323671497585 [2024-10-24 19:08:32,769 INFO L175 Difference]: Start difference. First operand has 70 places, 51 transitions, 218 flow. Second operand 3 states and 166 transitions. [2024-10-24 19:08:32,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 56 transitions, 311 flow [2024-10-24 19:08:32,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 56 transitions, 275 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-10-24 19:08:32,770 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 178 flow [2024-10-24 19:08:32,770 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2024-10-24 19:08:32,771 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2024-10-24 19:08:32,771 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 178 flow [2024-10-24 19:08:32,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 19:08:32,771 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 19:08:32,771 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:32,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 19:08:32,771 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-24 19:08:32,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 19:08:32,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1048517769, now seen corresponding path program 1 times [2024-10-24 19:08:32,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 19:08:32,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296520806] [2024-10-24 19:08:32,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 19:08:32,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 19:08:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:08:32,826 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 19:08:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 19:08:32,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 19:08:32,878 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 19:08:32,879 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 50 remaining) [2024-10-24 19:08:32,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2024-10-24 19:08:32,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2024-10-24 19:08:32,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2024-10-24 19:08:32,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2024-10-24 19:08:32,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2024-10-24 19:08:32,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2024-10-24 19:08:32,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2024-10-24 19:08:32,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2024-10-24 19:08:32,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2024-10-24 19:08:32,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2024-10-24 19:08:32,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2024-10-24 19:08:32,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2024-10-24 19:08:32,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2024-10-24 19:08:32,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2024-10-24 19:08:32,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2024-10-24 19:08:32,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2024-10-24 19:08:32,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2024-10-24 19:08:32,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2024-10-24 19:08:32,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2024-10-24 19:08:32,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2024-10-24 19:08:32,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2024-10-24 19:08:32,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2024-10-24 19:08:32,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2024-10-24 19:08:32,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2024-10-24 19:08:32,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (24 of 50 remaining) [2024-10-24 19:08:32,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 50 remaining) [2024-10-24 19:08:32,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2024-10-24 19:08:32,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2024-10-24 19:08:32,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2024-10-24 19:08:32,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2024-10-24 19:08:32,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2024-10-24 19:08:32,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2024-10-24 19:08:32,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2024-10-24 19:08:32,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2024-10-24 19:08:32,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2024-10-24 19:08:32,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2024-10-24 19:08:32,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2024-10-24 19:08:32,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2024-10-24 19:08:32,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2024-10-24 19:08:32,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2024-10-24 19:08:32,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2024-10-24 19:08:32,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2024-10-24 19:08:32,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2024-10-24 19:08:32,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2024-10-24 19:08:32,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2024-10-24 19:08:32,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2024-10-24 19:08:32,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2024-10-24 19:08:32,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2024-10-24 19:08:32,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 50 remaining) [2024-10-24 19:08:32,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 19:08:32,886 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 19:08:32,924 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 19:08:32,924 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 19:08:32,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:08:32 BasicIcfg [2024-10-24 19:08:32,928 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 19:08:32,929 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 19:08:32,929 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 19:08:32,929 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 19:08:32,929 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:08:23" (3/4) ... [2024-10-24 19:08:32,930 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 19:08:32,972 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 19:08:32,973 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 19:08:32,973 INFO L158 Benchmark]: Toolchain (without parser) took 11791.37ms. Allocated memory was 216.0MB in the beginning and 448.8MB in the end (delta: 232.8MB). Free memory was 184.1MB in the beginning and 381.1MB in the end (delta: -197.0MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2024-10-24 19:08:32,973 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 77.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:08:32,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1210.89ms. Allocated memory is still 216.0MB. Free memory was 184.1MB in the beginning and 142.6MB in the end (delta: 41.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-24 19:08:32,974 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.80ms. Allocated memory is still 216.0MB. Free memory was 142.6MB in the beginning and 139.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 19:08:32,974 INFO L158 Benchmark]: Boogie Preprocessor took 52.74ms. Allocated memory is still 216.0MB. Free memory was 139.5MB in the beginning and 136.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 19:08:32,974 INFO L158 Benchmark]: RCFGBuilder took 633.08ms. Allocated memory is still 216.0MB. Free memory was 136.3MB in the beginning and 132.2MB in the end (delta: 4.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-24 19:08:32,974 INFO L158 Benchmark]: TraceAbstraction took 9777.00ms. Allocated memory was 216.0MB in the beginning and 448.8MB in the end (delta: 232.8MB). Free memory was 132.2MB in the beginning and 385.3MB in the end (delta: -253.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 19:08:32,974 INFO L158 Benchmark]: Witness Printer took 43.90ms. Allocated memory is still 448.8MB. Free memory was 385.3MB in the beginning and 381.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 19:08:32,975 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 77.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1210.89ms. Allocated memory is still 216.0MB. Free memory was 184.1MB in the beginning and 142.6MB in the end (delta: 41.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.80ms. Allocated memory is still 216.0MB. Free memory was 142.6MB in the beginning and 139.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.74ms. Allocated memory is still 216.0MB. Free memory was 139.5MB in the beginning and 136.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 633.08ms. Allocated memory is still 216.0MB. Free memory was 136.3MB in the beginning and 132.2MB in the end (delta: 4.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9777.00ms. Allocated memory was 216.0MB in the beginning and 448.8MB in the end (delta: 232.8MB). Free memory was 132.2MB in the beginning and 385.3MB in the end (delta: -253.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 43.90ms. Allocated memory is still 448.8MB. Free memory was 385.3MB in the beginning and 381.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1254] 0 int j = __VERIFIER_nondet_int(); [L1255] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1255] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1256] 0 pthread_t t1; [L1257] 0 struct s *p; [L1258] CALL, EXPR 0 new(1) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1258] RET, EXPR 0 new(1) [L1258] 0 slot[j] = new(1) [L1259] CALL, EXPR 0 new(2) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1259] RET, EXPR 0 new(2) [L1259] EXPR 0 slot[j] [L1259] CALL 0 list_add(new(2), slot[j]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [mutex={1:0}, slot={2:0}] [L1241] 0 node->next = temp [L1259] RET 0 list_add(new(2), slot[j]) [L1260] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [j=9, mutex={1:0}, slot={2:0}, t1=-1] [L1246] 1 int i = __VERIFIER_nondet_int(); [L1247] CALL 1 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 1 !(!cond) [L1247] RET 1 assume_abort_if_not(0 <= i && i < 10) [L1249] CALL, EXPR 1 new(3) [L1233] 1 struct s *p = malloc(sizeof(struct s)); [L1234] 1 p->datum = x VAL [\old(arg)={0:0}, arg={0:0}, i=8, mutex={1:0}, slot={2:0}] [L1235] 1 p->next = ((void *)0) [L1236] 1 return p; [L1249] RET, EXPR 1 new(3) [L1249] EXPR 1 slot[i] [L1249] CALL 1 list_add(new(3), slot[i]) [L1239] 1 list->next - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1253]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1260]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 95 locations, 50 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.6s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3146 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2259 mSDsluCounter, 1746 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1712 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9339 IncrementalHoareTripleChecker+Invalid, 9455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 34 mSDtfsCounter, 9339 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=15, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 163 ConstructedInterpolants, 0 QuantifiedInterpolants, 2016 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-24 19:08:32,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)