./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr-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 c488feb98493d291286969cd9fdbd15fc14c729caece3fe94bd3c70430190936 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:05:54,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:05:54,439 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 18:05:54,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:05:54,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:05:54,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:05:54,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:05:54,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:05:54,484 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:05:54,484 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:05:54,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:05:54,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:05:54,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:05:54,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:05:54,489 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:05:54,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:05:54,490 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:05:54,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:05:54,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:05:54,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:05:54,491 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:05:54,491 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:05:54,491 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:05:54,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:05:54,492 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:05:54,492 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:05:54,492 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:05:54,492 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:05:54,493 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:05:54,493 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:05:54,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:05:54,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:05:54,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:05:54,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:05:54,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:05:54,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:05:54,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:05:54,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:05:54,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:05:54,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:05:54,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:05:54,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:05:54,496 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 -> c488feb98493d291286969cd9fdbd15fc14c729caece3fe94bd3c70430190936 [2024-11-10 18:05:54,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:05:54,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:05:54,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:05:54,764 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:05:54,764 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:05:54,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr-deref.i [2024-11-10 18:05:56,095 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:05:56,335 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:05:56,336 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr-deref.i [2024-11-10 18:05:56,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bf7333f5/d7f9a715140442538a98443a4e87f6b9/FLAG154796e24 [2024-11-10 18:05:56,659 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bf7333f5/d7f9a715140442538a98443a4e87f6b9 [2024-11-10 18:05:56,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:05:56,662 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:05:56,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:05:56,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:05:56,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:05:56,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:05:56" (1/1) ... [2024-11-10 18:05:56,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b9f189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:56, skipping insertion in model container [2024-11-10 18:05:56,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:05:56" (1/1) ... [2024-11-10 18:05:56,707 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:05:57,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:05:57,223 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:05:57,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:05:57,351 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:05:57,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:57 WrapperNode [2024-11-10 18:05:57,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:05:57,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:05:57,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:05:57,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:05:57,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:57" (1/1) ... [2024-11-10 18:05:57,386 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:57" (1/1) ... [2024-11-10 18:05:57,428 INFO L138 Inliner]: procedures = 372, calls = 88, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 178 [2024-11-10 18:05:57,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:05:57,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:05:57,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:05:57,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:05:57,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:57" (1/1) ... [2024-11-10 18:05:57,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:57" (1/1) ... [2024-11-10 18:05:57,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:57" (1/1) ... [2024-11-10 18:05:57,462 INFO L175 MemorySlicer]: Split 78 memory accesses to 3 slices as follows [50, 14, 14]. 64 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 11 writes are split as follows [0, 1, 10]. [2024-11-10 18:05:57,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:57" (1/1) ... [2024-11-10 18:05:57,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:57" (1/1) ... [2024-11-10 18:05:57,479 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:57" (1/1) ... [2024-11-10 18:05:57,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:57" (1/1) ... [2024-11-10 18:05:57,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:57" (1/1) ... [2024-11-10 18:05:57,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:57" (1/1) ... [2024-11-10 18:05:57,491 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:05:57,491 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:05:57,492 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:05:57,492 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:05:57,492 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:57" (1/1) ... [2024-11-10 18:05:57,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:05:57,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:05:57,535 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-11-10 18:05:57,538 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-11-10 18:05:57,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 18:05:57,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 18:05:57,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 18:05:57,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 18:05:57,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 18:05:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-10 18:05:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 18:05:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 18:05:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 18:05:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 18:05:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 18:05:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 18:05:57,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 18:05:57,585 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 18:05:57,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 18:05:57,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:05:57,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 18:05:57,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 18:05:57,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 18:05:57,585 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-10 18:05:57,586 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-10 18:05:57,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:05:57,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 18:05:57,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 18:05:57,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:05:57,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:05:57,587 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 18:05:57,751 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:05:57,754 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:05:58,106 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:05:58,106 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:05:58,413 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:05:58,413 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:05:58,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:05:58 BoogieIcfgContainer [2024-11-10 18:05:58,414 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:05:58,417 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:05:58,417 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:05:58,420 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:05:58,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:05:56" (1/3) ... [2024-11-10 18:05:58,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a33529d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:05:58, skipping insertion in model container [2024-11-10 18:05:58,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:57" (2/3) ... [2024-11-10 18:05:58,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a33529d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:05:58, skipping insertion in model container [2024-11-10 18:05:58,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:05:58" (3/3) ... [2024-11-10 18:05:58,423 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_11-arraylist_nr-deref.i [2024-11-10 18:05:58,437 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:05:58,438 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-11-10 18:05:58,438 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:05:58,495 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 18:05:58,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 74 transitions, 152 flow [2024-11-10 18:05:58,569 INFO L124 PetriNetUnfolderBase]: 2/73 cut-off events. [2024-11-10 18:05:58,569 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:05:58,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 73 events. 2/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 167 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-11-10 18:05:58,573 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 74 transitions, 152 flow [2024-11-10 18:05:58,577 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 73 transitions, 149 flow [2024-11-10 18:05:58,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:05:58,596 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;@67c6ff9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:05:58,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-10 18:05:58,602 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:05:58,602 INFO L124 PetriNetUnfolderBase]: 2/7 cut-off events. [2024-11-10 18:05:58,602 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:05:58,603 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:05:58,605 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-10 18:05:58,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 18:05:58,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:05:58,610 INFO L85 PathProgramCache]: Analyzing trace with hash 15962710, now seen corresponding path program 1 times [2024-11-10 18:05:58,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:05:58,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230115505] [2024-11-10 18:05:58,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:05:58,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:05:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:05:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:05:58,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:05:58,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230115505] [2024-11-10 18:05:58,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230115505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:05:58,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:05:58,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:05:58,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706019919] [2024-11-10 18:05:58,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:05:58,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 18:05:58,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:05:58,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 18:05:58,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:05:58,867 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 74 [2024-11-10 18:05:58,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 73 transitions, 149 flow. Second operand has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 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-11-10 18:05:58,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:05:58,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 74 [2024-11-10 18:05:58,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:05:58,991 INFO L124 PetriNetUnfolderBase]: 64/267 cut-off events. [2024-11-10 18:05:58,992 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:05:58,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 267 events. 64/267 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1208 event pairs, 63 based on Foata normal form. 1/206 useless extension candidates. Maximal degree in co-relation 376. Up to 153 conditions per place. [2024-11-10 18:05:58,996 INFO L140 encePairwiseOnDemand]: 73/74 looper letters, 26 selfloop transitions, 0 changer transitions 0/72 dead transitions. [2024-11-10 18:05:58,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 72 transitions, 199 flow [2024-11-10 18:05:59,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 18:05:59,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 18:05:59,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 121 transitions. [2024-11-10 18:05:59,013 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8175675675675675 [2024-11-10 18:05:59,015 INFO L175 Difference]: Start difference. First operand has 75 places, 73 transitions, 149 flow. Second operand 2 states and 121 transitions. [2024-11-10 18:05:59,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 72 transitions, 199 flow [2024-11-10 18:05:59,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 72 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:05:59,021 INFO L231 Difference]: Finished difference. Result has 75 places, 72 transitions, 146 flow [2024-11-10 18:05:59,025 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=146, PETRI_PLACES=75, PETRI_TRANSITIONS=72} [2024-11-10 18:05:59,030 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 0 predicate places. [2024-11-10 18:05:59,030 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 72 transitions, 146 flow [2024-11-10 18:05:59,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.5) internal successors, (97), 2 states have internal predecessors, (97), 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-11-10 18:05:59,031 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:05:59,031 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 18:05:59,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:05:59,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 18:05:59,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:05:59,033 INFO L85 PathProgramCache]: Analyzing trace with hash 494843425, now seen corresponding path program 1 times [2024-11-10 18:05:59,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:05:59,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096908801] [2024-11-10 18:05:59,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:05:59,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:05:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:05:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:05:59,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:05:59,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096908801] [2024-11-10 18:05:59,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096908801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:05:59,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:05:59,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:05:59,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833059941] [2024-11-10 18:05:59,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:05:59,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:05:59,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:05:59,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:05:59,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:05:59,185 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 74 [2024-11-10 18:05:59,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 72 transitions, 146 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-11-10 18:05:59,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:05:59,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 74 [2024-11-10 18:05:59,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:05:59,319 INFO L124 PetriNetUnfolderBase]: 64/269 cut-off events. [2024-11-10 18:05:59,319 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:05:59,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 269 events. 64/269 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1201 event pairs, 63 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 425. Up to 154 conditions per place. [2024-11-10 18:05:59,323 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 26 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2024-11-10 18:05:59,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 73 transitions, 204 flow [2024-11-10 18:05:59,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:05:59,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:05:59,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2024-11-10 18:05:59,326 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7522522522522522 [2024-11-10 18:05:59,326 INFO L175 Difference]: Start difference. First operand has 75 places, 72 transitions, 146 flow. Second operand 3 states and 167 transitions. [2024-11-10 18:05:59,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 73 transitions, 204 flow [2024-11-10 18:05:59,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 73 transitions, 204 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 18:05:59,330 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 158 flow [2024-11-10 18:05:59,330 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=78, PETRI_TRANSITIONS=73} [2024-11-10 18:05:59,331 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 3 predicate places. [2024-11-10 18:05:59,331 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 158 flow [2024-11-10 18:05:59,332 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-11-10 18:05:59,332 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:05:59,332 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-10 18:05:59,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:05:59,332 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 18:05:59,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:05:59,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1194712199, now seen corresponding path program 1 times [2024-11-10 18:05:59,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:05:59,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170300660] [2024-11-10 18:05:59,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:05:59,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:05:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:05:59,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:05:59,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:05:59,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170300660] [2024-11-10 18:05:59,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170300660] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:05:59,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426810714] [2024-11-10 18:05:59,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:05:59,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:05:59,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:05:59,419 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:05:59,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 18:05:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:05:59,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:05:59,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:05:59,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:05:59,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:05:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:05:59,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426810714] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:05:59,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:05:59,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-10 18:05:59,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278008423] [2024-11-10 18:05:59,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:05:59,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 18:05:59,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:05:59,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 18:05:59,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:05:59,604 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 74 [2024-11-10 18:05:59,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 158 flow. Second operand has 7 states, 7 states have (on average 47.285714285714285) internal successors, (331), 7 states have internal predecessors, (331), 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-11-10 18:05:59,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:05:59,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 74 [2024-11-10 18:05:59,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:05:59,715 INFO L124 PetriNetUnfolderBase]: 64/275 cut-off events. [2024-11-10 18:05:59,716 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-10 18:05:59,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 275 events. 64/275 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1207 event pairs, 63 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 442. Up to 154 conditions per place. [2024-11-10 18:05:59,718 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 26 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2024-11-10 18:05:59,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 76 transitions, 232 flow [2024-11-10 18:05:59,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:05:59,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:05:59,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 310 transitions. [2024-11-10 18:05:59,722 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6981981981981982 [2024-11-10 18:05:59,722 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 158 flow. Second operand 6 states and 310 transitions. [2024-11-10 18:05:59,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 76 transitions, 232 flow [2024-11-10 18:05:59,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 76 transitions, 230 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:05:59,724 INFO L231 Difference]: Finished difference. Result has 85 places, 76 transitions, 192 flow [2024-11-10 18:05:59,724 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=85, PETRI_TRANSITIONS=76} [2024-11-10 18:05:59,725 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2024-11-10 18:05:59,725 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 76 transitions, 192 flow [2024-11-10 18:05:59,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 47.285714285714285) internal successors, (331), 7 states have internal predecessors, (331), 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-11-10 18:05:59,727 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:05:59,727 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1] [2024-11-10 18:05:59,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 18:05:59,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:05:59,932 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 18:05:59,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:05:59,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1627478143, now seen corresponding path program 2 times [2024-11-10 18:05:59,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:05:59,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365773361] [2024-11-10 18:05:59,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:05:59,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:05:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:06:00,014 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 18:06:00,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:06:00,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365773361] [2024-11-10 18:06:00,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365773361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:06:00,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:06:00,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:06:00,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721084675] [2024-11-10 18:06:00,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:06:00,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:06:00,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:06:00,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:06:00,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:06:00,064 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 74 [2024-11-10 18:06:00,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 76 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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-11-10 18:06:00,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:06:00,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 74 [2024-11-10 18:06:00,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:06:00,141 INFO L124 PetriNetUnfolderBase]: 64/271 cut-off events. [2024-11-10 18:06:00,141 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-10 18:06:00,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 271 events. 64/271 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1181 event pairs, 63 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 450. Up to 155 conditions per place. [2024-11-10 18:06:00,145 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 28 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2024-11-10 18:06:00,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 72 transitions, 248 flow [2024-11-10 18:06:00,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:06:00,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:06:00,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2024-11-10 18:06:00,147 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6981981981981982 [2024-11-10 18:06:00,147 INFO L175 Difference]: Start difference. First operand has 85 places, 76 transitions, 192 flow. Second operand 3 states and 155 transitions. [2024-11-10 18:06:00,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 72 transitions, 248 flow [2024-11-10 18:06:00,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 72 transitions, 240 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-10 18:06:00,149 INFO L231 Difference]: Finished difference. Result has 82 places, 72 transitions, 184 flow [2024-11-10 18:06:00,149 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=82, PETRI_TRANSITIONS=72} [2024-11-10 18:06:00,152 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 7 predicate places. [2024-11-10 18:06:00,152 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 72 transitions, 184 flow [2024-11-10 18:06:00,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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-11-10 18:06:00,153 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:06:00,153 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1] [2024-11-10 18:06:00,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:06:00,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 18:06:00,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:06:00,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1627478142, now seen corresponding path program 1 times [2024-11-10 18:06:00,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:06:00,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442123770] [2024-11-10 18:06:00,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:06:00,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:06:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:06:00,251 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:06:00,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:06:00,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442123770] [2024-11-10 18:06:00,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442123770] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:06:00,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840147706] [2024-11-10 18:06:00,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:06:00,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:06:00,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:06:00,254 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:06:00,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 18:06:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:06:00,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:06:00,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:06:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:06:00,401 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:06:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:06:00,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840147706] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:06:00,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:06:00,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-10 18:06:00,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586345201] [2024-11-10 18:06:00,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:06:00,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 18:06:00,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:06:00,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 18:06:00,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:06:00,480 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 74 [2024-11-10 18:06:00,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 72 transitions, 184 flow. Second operand has 13 states, 13 states have (on average 47.15384615384615) internal successors, (613), 13 states have internal predecessors, (613), 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-11-10 18:06:00,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:06:00,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 74 [2024-11-10 18:06:00,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:06:00,629 INFO L124 PetriNetUnfolderBase]: 64/283 cut-off events. [2024-11-10 18:06:00,629 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2024-11-10 18:06:00,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 283 events. 64/283 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1187 event pairs, 63 based on Foata normal form. 6/231 useless extension candidates. Maximal degree in co-relation 479. Up to 154 conditions per place. [2024-11-10 18:06:00,632 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 26 selfloop transitions, 11 changer transitions 0/78 dead transitions. [2024-11-10 18:06:00,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 78 transitions, 294 flow [2024-11-10 18:06:00,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 18:06:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 18:06:00,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 595 transitions. [2024-11-10 18:06:00,634 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.670045045045045 [2024-11-10 18:06:00,635 INFO L175 Difference]: Start difference. First operand has 82 places, 72 transitions, 184 flow. Second operand 12 states and 595 transitions. [2024-11-10 18:06:00,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 78 transitions, 294 flow [2024-11-10 18:06:00,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 78 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:06:00,640 INFO L231 Difference]: Finished difference. Result has 97 places, 78 transitions, 260 flow [2024-11-10 18:06:00,640 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=260, PETRI_PLACES=97, PETRI_TRANSITIONS=78} [2024-11-10 18:06:00,641 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 22 predicate places. [2024-11-10 18:06:00,642 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 78 transitions, 260 flow [2024-11-10 18:06:00,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 47.15384615384615) internal successors, (613), 13 states have internal predecessors, (613), 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-11-10 18:06:00,643 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:06:00,643 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1] [2024-11-10 18:06:00,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 18:06:00,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:06:00,850 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 18:06:00,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:06:00,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1483162222, now seen corresponding path program 2 times [2024-11-10 18:06:00,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:06:00,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915971327] [2024-11-10 18:06:00,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:06:00,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:06:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:06:00,947 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-10 18:06:00,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:06:00,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915971327] [2024-11-10 18:06:00,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915971327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:06:00,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:06:00,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:06:00,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422579690] [2024-11-10 18:06:00,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:06:00,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:06:00,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:06:00,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:06:00,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:06:00,993 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 74 [2024-11-10 18:06:00,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 78 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-11-10 18:06:00,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:06:00,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 74 [2024-11-10 18:06:00,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:06:01,066 INFO L124 PetriNetUnfolderBase]: 64/279 cut-off events. [2024-11-10 18:06:01,066 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2024-11-10 18:06:01,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 279 events. 64/279 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1172 event pairs, 63 based on Foata normal form. 2/225 useless extension candidates. Maximal degree in co-relation 494. Up to 161 conditions per place. [2024-11-10 18:06:01,068 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 32 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2024-11-10 18:06:01,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 74 transitions, 324 flow [2024-11-10 18:06:01,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:06:01,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:06:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2024-11-10 18:06:01,069 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2024-11-10 18:06:01,069 INFO L175 Difference]: Start difference. First operand has 97 places, 78 transitions, 260 flow. Second operand 3 states and 159 transitions. [2024-11-10 18:06:01,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 74 transitions, 324 flow [2024-11-10 18:06:01,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 74 transitions, 288 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-11-10 18:06:01,073 INFO L231 Difference]: Finished difference. Result has 90 places, 74 transitions, 224 flow [2024-11-10 18:06:01,073 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=90, PETRI_TRANSITIONS=74} [2024-11-10 18:06:01,073 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 15 predicate places. [2024-11-10 18:06:01,074 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 74 transitions, 224 flow [2024-11-10 18:06:01,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-11-10 18:06:01,074 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:06:01,074 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2024-11-10 18:06:01,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:06:01,074 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 18:06:01,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:06:01,075 INFO L85 PathProgramCache]: Analyzing trace with hash 610260620, now seen corresponding path program 1 times [2024-11-10 18:06:01,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:06:01,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007312139] [2024-11-10 18:06:01,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:06:01,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:06:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:06:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-10 18:06:01,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:06:01,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007312139] [2024-11-10 18:06:01,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007312139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:06:01,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:06:01,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:06:01,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577767204] [2024-11-10 18:06:01,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:06:01,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:06:01,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:06:01,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:06:01,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:06:01,504 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 74 [2024-11-10 18:06:01,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 74 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:06:01,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:06:01,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 74 [2024-11-10 18:06:01,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:06:01,667 INFO L124 PetriNetUnfolderBase]: 73/297 cut-off events. [2024-11-10 18:06:01,667 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-11-10 18:06:01,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 297 events. 73/297 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1286 event pairs, 63 based on Foata normal form. 1/246 useless extension candidates. Maximal degree in co-relation 517. Up to 148 conditions per place. [2024-11-10 18:06:01,669 INFO L140 encePairwiseOnDemand]: 61/74 looper letters, 37 selfloop transitions, 6 changer transitions 3/76 dead transitions. [2024-11-10 18:06:01,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 76 transitions, 320 flow [2024-11-10 18:06:01,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:06:01,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:06:01,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 239 transitions. [2024-11-10 18:06:01,671 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6459459459459459 [2024-11-10 18:06:01,671 INFO L175 Difference]: Start difference. First operand has 90 places, 74 transitions, 224 flow. Second operand 5 states and 239 transitions. [2024-11-10 18:06:01,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 76 transitions, 320 flow [2024-11-10 18:06:01,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 76 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:06:01,675 INFO L231 Difference]: Finished difference. Result has 85 places, 67 transitions, 214 flow [2024-11-10 18:06:01,676 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=85, PETRI_TRANSITIONS=67} [2024-11-10 18:06:01,676 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2024-11-10 18:06:01,676 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 67 transitions, 214 flow [2024-11-10 18:06:01,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:06:01,677 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:06:01,677 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:06:01,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 18:06:01,677 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 18:06:01,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:06:01,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1389124906, now seen corresponding path program 1 times [2024-11-10 18:06:01,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:06:01,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103177845] [2024-11-10 18:06:01,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:06:01,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:06:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:06:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-10 18:06:02,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:06:02,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103177845] [2024-11-10 18:06:02,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103177845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:06:02,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:06:02,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 18:06:02,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956311979] [2024-11-10 18:06:02,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:06:02,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 18:06:02,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:06:02,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 18:06:02,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:06:02,355 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 74 [2024-11-10 18:06:02,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 67 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 39.42857142857143) internal successors, (276), 7 states have internal predecessors, (276), 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-11-10 18:06:02,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:06:02,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 74 [2024-11-10 18:06:02,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:06:02,499 INFO L124 PetriNetUnfolderBase]: 64/265 cut-off events. [2024-11-10 18:06:02,499 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-11-10 18:06:02,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 265 events. 64/265 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1091 event pairs, 54 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 480. Up to 126 conditions per place. [2024-11-10 18:06:02,501 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 38 selfloop transitions, 7 changer transitions 3/74 dead transitions. [2024-11-10 18:06:02,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 74 transitions, 324 flow [2024-11-10 18:06:02,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:06:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 18:06:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 306 transitions. [2024-11-10 18:06:02,502 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5907335907335908 [2024-11-10 18:06:02,502 INFO L175 Difference]: Start difference. First operand has 85 places, 67 transitions, 214 flow. Second operand 7 states and 306 transitions. [2024-11-10 18:06:02,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 74 transitions, 324 flow [2024-11-10 18:06:02,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 74 transitions, 312 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 18:06:02,505 INFO L231 Difference]: Finished difference. Result has 85 places, 65 transitions, 212 flow [2024-11-10 18:06:02,505 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=212, PETRI_PLACES=85, PETRI_TRANSITIONS=65} [2024-11-10 18:06:02,505 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2024-11-10 18:06:02,505 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 65 transitions, 212 flow [2024-11-10 18:06:02,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.42857142857143) internal successors, (276), 7 states have internal predecessors, (276), 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-11-10 18:06:02,506 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:06:02,506 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:06:02,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 18:06:02,506 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 18:06:02,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:06:02,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1389124905, now seen corresponding path program 1 times [2024-11-10 18:06:02,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:06:02,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721704710] [2024-11-10 18:06:02,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:06:02,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:06:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:06:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-10 18:06:02,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:06:02,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721704710] [2024-11-10 18:06:02,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721704710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:06:02,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:06:02,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 18:06:02,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716069499] [2024-11-10 18:06:02,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:06:02,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 18:06:02,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:06:02,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 18:06:02,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:06:03,139 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2024-11-10 18:06:03,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 65 transitions, 212 flow. Second operand has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 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-11-10 18:06:03,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:06:03,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2024-11-10 18:06:03,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:06:03,293 INFO L124 PetriNetUnfolderBase]: 64/263 cut-off events. [2024-11-10 18:06:03,293 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-11-10 18:06:03,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 263 events. 64/263 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1091 event pairs, 54 based on Foata normal form. 1/221 useless extension candidates. Maximal degree in co-relation 478. Up to 126 conditions per place. [2024-11-10 18:06:03,295 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 37 selfloop transitions, 7 changer transitions 3/72 dead transitions. [2024-11-10 18:06:03,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 72 transitions, 320 flow [2024-11-10 18:06:03,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:06:03,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 18:06:03,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 284 transitions. [2024-11-10 18:06:03,296 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5482625482625483 [2024-11-10 18:06:03,296 INFO L175 Difference]: Start difference. First operand has 85 places, 65 transitions, 212 flow. Second operand 7 states and 284 transitions. [2024-11-10 18:06:03,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 72 transitions, 320 flow [2024-11-10 18:06:03,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 72 transitions, 306 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-10 18:06:03,299 INFO L231 Difference]: Finished difference. Result has 83 places, 63 transitions, 208 flow [2024-11-10 18:06:03,299 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=208, PETRI_PLACES=83, PETRI_TRANSITIONS=63} [2024-11-10 18:06:03,300 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 8 predicate places. [2024-11-10 18:06:03,300 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 63 transitions, 208 flow [2024-11-10 18:06:03,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 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-11-10 18:06:03,300 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:06:03,300 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:06:03,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 18:06:03,301 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 18:06:03,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:06:03,301 INFO L85 PathProgramCache]: Analyzing trace with hash 785812067, now seen corresponding path program 1 times [2024-11-10 18:06:03,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:06:03,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51772296] [2024-11-10 18:06:03,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:06:03,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:06:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:06:03,523 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-10 18:06:03,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:06:03,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51772296] [2024-11-10 18:06:03,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51772296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:06:03,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:06:03,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:06:03,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390595481] [2024-11-10 18:06:03,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:06:03,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:06:03,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:06:03,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:06:03,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:06:03,651 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 74 [2024-11-10 18:06:03,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 63 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 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-11-10 18:06:03,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:06:03,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 74 [2024-11-10 18:06:03,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:06:03,747 INFO L124 PetriNetUnfolderBase]: 64/262 cut-off events. [2024-11-10 18:06:03,747 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2024-11-10 18:06:03,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 262 events. 64/262 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1091 event pairs, 63 based on Foata normal form. 1/221 useless extension candidates. Maximal degree in co-relation 475. Up to 158 conditions per place. [2024-11-10 18:06:03,749 INFO L140 encePairwiseOnDemand]: 67/74 looper letters, 30 selfloop transitions, 6 changer transitions 0/62 dead transitions. [2024-11-10 18:06:03,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 62 transitions, 278 flow [2024-11-10 18:06:03,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:06:03,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:06:03,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 237 transitions. [2024-11-10 18:06:03,750 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6405405405405405 [2024-11-10 18:06:03,750 INFO L175 Difference]: Start difference. First operand has 83 places, 63 transitions, 208 flow. Second operand 5 states and 237 transitions. [2024-11-10 18:06:03,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 62 transitions, 278 flow [2024-11-10 18:06:03,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 62 transitions, 264 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-10 18:06:03,752 INFO L231 Difference]: Finished difference. Result has 80 places, 62 transitions, 204 flow [2024-11-10 18:06:03,752 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=80, PETRI_TRANSITIONS=62} [2024-11-10 18:06:03,752 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 5 predicate places. [2024-11-10 18:06:03,753 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 62 transitions, 204 flow [2024-11-10 18:06:03,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 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-11-10 18:06:03,753 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:06:03,753 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:06:03,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 18:06:03,755 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 18:06:03,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:06:03,756 INFO L85 PathProgramCache]: Analyzing trace with hash 785812066, now seen corresponding path program 1 times [2024-11-10 18:06:03,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:06:03,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478514142] [2024-11-10 18:06:03,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:06:03,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:06:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:06:03,856 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-10 18:06:03,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:06:03,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478514142] [2024-11-10 18:06:03,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478514142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:06:03,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:06:03,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:06:03,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343045159] [2024-11-10 18:06:03,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:06:03,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:06:03,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:06:03,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:06:03,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:06:03,924 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 74 [2024-11-10 18:06:03,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 62 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 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-11-10 18:06:03,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:06:03,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 74 [2024-11-10 18:06:03,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:06:04,020 INFO L124 PetriNetUnfolderBase]: 64/261 cut-off events. [2024-11-10 18:06:04,020 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-11-10 18:06:04,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 261 events. 64/261 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1088 event pairs, 63 based on Foata normal form. 1/220 useless extension candidates. Maximal degree in co-relation 466. Up to 158 conditions per place. [2024-11-10 18:06:04,021 INFO L140 encePairwiseOnDemand]: 67/74 looper letters, 32 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2024-11-10 18:06:04,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 61 transitions, 278 flow [2024-11-10 18:06:04,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:06:04,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:06:04,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 229 transitions. [2024-11-10 18:06:04,022 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6189189189189189 [2024-11-10 18:06:04,023 INFO L175 Difference]: Start difference. First operand has 80 places, 62 transitions, 204 flow. Second operand 5 states and 229 transitions. [2024-11-10 18:06:04,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 61 transitions, 278 flow [2024-11-10 18:06:04,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 61 transitions, 266 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 18:06:04,024 INFO L231 Difference]: Finished difference. Result has 79 places, 61 transitions, 202 flow [2024-11-10 18:06:04,024 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=79, PETRI_TRANSITIONS=61} [2024-11-10 18:06:04,025 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 4 predicate places. [2024-11-10 18:06:04,025 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 61 transitions, 202 flow [2024-11-10 18:06:04,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 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-11-10 18:06:04,025 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:06:04,026 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:06:04,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 18:06:04,026 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 18:06:04,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:06:04,026 INFO L85 PathProgramCache]: Analyzing trace with hash -326381772, now seen corresponding path program 1 times [2024-11-10 18:06:04,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:06:04,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888847920] [2024-11-10 18:06:04,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:06:04,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:06:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:06:04,160 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-10 18:06:04,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:06:04,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888847920] [2024-11-10 18:06:04,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888847920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:06:04,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:06:04,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:06:04,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404896210] [2024-11-10 18:06:04,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:06:04,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:06:04,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:06:04,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:06:04,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:06:04,197 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 74 [2024-11-10 18:06:04,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 61 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-11-10 18:06:04,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:06:04,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 74 [2024-11-10 18:06:04,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:06:04,268 INFO L124 PetriNetUnfolderBase]: 64/264 cut-off events. [2024-11-10 18:06:04,268 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-11-10 18:06:04,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 264 events. 64/264 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1099 event pairs, 56 based on Foata normal form. 8/235 useless extension candidates. Maximal degree in co-relation 467. Up to 148 conditions per place. [2024-11-10 18:06:04,269 INFO L140 encePairwiseOnDemand]: 70/74 looper letters, 41 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-11-10 18:06:04,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 66 transitions, 298 flow [2024-11-10 18:06:04,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:06:04,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:06:04,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2024-11-10 18:06:04,270 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7657657657657657 [2024-11-10 18:06:04,270 INFO L175 Difference]: Start difference. First operand has 79 places, 61 transitions, 202 flow. Second operand 3 states and 170 transitions. [2024-11-10 18:06:04,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 66 transitions, 298 flow [2024-11-10 18:06:04,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 66 transitions, 286 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 18:06:04,272 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 190 flow [2024-11-10 18:06:04,272 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2024-11-10 18:06:04,273 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 0 predicate places. [2024-11-10 18:06:04,273 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 190 flow [2024-11-10 18:06:04,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-11-10 18:06:04,273 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:06:04,273 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:06:04,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 18:06:04,273 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 18:06:04,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:06:04,274 INFO L85 PathProgramCache]: Analyzing trace with hash -326381773, now seen corresponding path program 1 times [2024-11-10 18:06:04,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:06:04,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868468339] [2024-11-10 18:06:04,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:06:04,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:06:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:06:04,344 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-10 18:06:04,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:06:04,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868468339] [2024-11-10 18:06:04,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868468339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:06:04,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:06:04,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:06:04,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456486380] [2024-11-10 18:06:04,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:06:04,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:06:04,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:06:04,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:06:04,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:06:04,381 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2024-11-10 18:06:04,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-11-10 18:06:04,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:06:04,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2024-11-10 18:06:04,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:06:04,442 INFO L124 PetriNetUnfolderBase]: 71/255 cut-off events. [2024-11-10 18:06:04,442 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-11-10 18:06:04,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 255 events. 71/255 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 988 event pairs, 56 based on Foata normal form. 8/234 useless extension candidates. Maximal degree in co-relation 483. Up to 148 conditions per place. [2024-11-10 18:06:04,444 INFO L140 encePairwiseOnDemand]: 70/74 looper letters, 42 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-11-10 18:06:04,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 64 transitions, 288 flow [2024-11-10 18:06:04,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:06:04,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:06:04,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2024-11-10 18:06:04,445 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7567567567567568 [2024-11-10 18:06:04,445 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 190 flow. Second operand 3 states and 168 transitions. [2024-11-10 18:06:04,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 64 transitions, 288 flow [2024-11-10 18:06:04,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 64 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:06:04,446 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 186 flow [2024-11-10 18:06:04,447 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2024-11-10 18:06:04,447 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, -2 predicate places. [2024-11-10 18:06:04,447 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 186 flow [2024-11-10 18:06:04,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-11-10 18:06:04,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:06:04,448 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:06:04,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 18:06:04,448 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 18:06:04,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:06:04,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1539889732, now seen corresponding path program 1 times [2024-11-10 18:06:04,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:06:04,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612550594] [2024-11-10 18:06:04,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:06:04,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:06:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:06:04,792 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-10 18:06:04,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:06:04,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612550594] [2024-11-10 18:06:04,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612550594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:06:04,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:06:04,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 18:06:04,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128753840] [2024-11-10 18:06:04,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:06:04,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 18:06:04,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:06:04,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 18:06:04,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:06:05,055 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 74 [2024-11-10 18:06:05,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 186 flow. Second operand has 9 states, 9 states have (on average 43.666666666666664) internal successors, (393), 9 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-11-10 18:06:05,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:06:05,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 74 [2024-11-10 18:06:05,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:06:05,205 INFO L124 PetriNetUnfolderBase]: 73/268 cut-off events. [2024-11-10 18:06:05,205 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2024-11-10 18:06:05,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 268 events. 73/268 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1056 event pairs, 54 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 503. Up to 125 conditions per place. [2024-11-10 18:06:05,207 INFO L140 encePairwiseOnDemand]: 63/74 looper letters, 43 selfloop transitions, 10 changer transitions 3/74 dead transitions. [2024-11-10 18:06:05,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 74 transitions, 340 flow [2024-11-10 18:06:05,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:06:05,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 18:06:05,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 467 transitions. [2024-11-10 18:06:05,208 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6310810810810811 [2024-11-10 18:06:05,208 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 186 flow. Second operand 10 states and 467 transitions. [2024-11-10 18:06:05,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 74 transitions, 340 flow [2024-11-10 18:06:05,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 74 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:06:05,210 INFO L231 Difference]: Finished difference. Result has 79 places, 56 transitions, 200 flow [2024-11-10 18:06:05,210 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=200, PETRI_PLACES=79, PETRI_TRANSITIONS=56} [2024-11-10 18:06:05,211 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 4 predicate places. [2024-11-10 18:06:05,211 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 56 transitions, 200 flow [2024-11-10 18:06:05,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 43.666666666666664) internal successors, (393), 9 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-11-10 18:06:05,212 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:06:05,212 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:06:05,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 18:06:05,212 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 18:06:05,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:06:05,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1539889733, now seen corresponding path program 1 times [2024-11-10 18:06:05,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:06:05,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004094198] [2024-11-10 18:06:05,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:06:05,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:06:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:06:05,353 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-10 18:06:05,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:06:05,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004094198] [2024-11-10 18:06:05,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004094198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:06:05,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:06:05,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:06:05,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932795530] [2024-11-10 18:06:05,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:06:05,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:06:05,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:06:05,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:06:05,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:06:05,477 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 74 [2024-11-10 18:06:05,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 56 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 44.5) internal successors, (267), 6 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-11-10 18:06:05,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:06:05,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 74 [2024-11-10 18:06:05,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:06:05,592 INFO L124 PetriNetUnfolderBase]: 73/258 cut-off events. [2024-11-10 18:06:05,592 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2024-11-10 18:06:05,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 258 events. 73/258 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 964 event pairs, 54 based on Foata normal form. 10/241 useless extension candidates. Maximal degree in co-relation 512. Up to 125 conditions per place. [2024-11-10 18:06:05,594 INFO L140 encePairwiseOnDemand]: 67/74 looper letters, 47 selfloop transitions, 6 changer transitions 3/73 dead transitions. [2024-11-10 18:06:05,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 73 transitions, 346 flow [2024-11-10 18:06:05,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:06:05,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:06:05,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 299 transitions. [2024-11-10 18:06:05,595 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6734234234234234 [2024-11-10 18:06:05,595 INFO L175 Difference]: Start difference. First operand has 79 places, 56 transitions, 200 flow. Second operand 6 states and 299 transitions. [2024-11-10 18:06:05,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 73 transitions, 346 flow [2024-11-10 18:06:05,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 73 transitions, 326 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-11-10 18:06:05,597 INFO L231 Difference]: Finished difference. Result has 74 places, 55 transitions, 190 flow [2024-11-10 18:06:05,597 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=74, PETRI_TRANSITIONS=55} [2024-11-10 18:06:05,597 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, -1 predicate places. [2024-11-10 18:06:05,597 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 55 transitions, 190 flow [2024-11-10 18:06:05,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.5) internal successors, (267), 6 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-11-10 18:06:05,598 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:06:05,598 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:06:05,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 18:06:05,598 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 18:06:05,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:06:05,599 INFO L85 PathProgramCache]: Analyzing trace with hash -491940964, now seen corresponding path program 1 times [2024-11-10 18:06:05,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:06:05,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433839679] [2024-11-10 18:06:05,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:06:05,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:06:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:06:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-10 18:06:06,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:06:06,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433839679] [2024-11-10 18:06:06,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433839679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:06:06,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:06:06,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 18:06:06,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946097439] [2024-11-10 18:06:06,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:06:06,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 18:06:06,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:06:06,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 18:06:06,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:06:07,116 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 74 [2024-11-10 18:06:07,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 55 transitions, 190 flow. Second operand has 13 states, 13 states have (on average 32.38461538461539) internal successors, (421), 13 states have internal predecessors, (421), 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-11-10 18:06:07,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:06:07,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 74 [2024-11-10 18:06:07,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:06:07,459 INFO L124 PetriNetUnfolderBase]: 124/391 cut-off events. [2024-11-10 18:06:07,459 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-11-10 18:06:07,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 391 events. 124/391 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1763 event pairs, 41 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 766. Up to 174 conditions per place. [2024-11-10 18:06:07,461 INFO L140 encePairwiseOnDemand]: 61/74 looper letters, 59 selfloop transitions, 15 changer transitions 0/86 dead transitions. [2024-11-10 18:06:07,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 86 transitions, 408 flow [2024-11-10 18:06:07,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 18:06:07,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-10 18:06:07,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 469 transitions. [2024-11-10 18:06:07,463 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4875259875259875 [2024-11-10 18:06:07,463 INFO L175 Difference]: Start difference. First operand has 74 places, 55 transitions, 190 flow. Second operand 13 states and 469 transitions. [2024-11-10 18:06:07,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 86 transitions, 408 flow [2024-11-10 18:06:07,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 86 transitions, 388 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 18:06:07,465 INFO L231 Difference]: Finished difference. Result has 85 places, 62 transitions, 245 flow [2024-11-10 18:06:07,465 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=245, PETRI_PLACES=85, PETRI_TRANSITIONS=62} [2024-11-10 18:06:07,466 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2024-11-10 18:06:07,466 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 62 transitions, 245 flow [2024-11-10 18:06:07,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 32.38461538461539) internal successors, (421), 13 states have internal predecessors, (421), 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-11-10 18:06:07,466 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:06:07,466 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:06:07,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 18:06:07,467 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 18:06:07,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:06:07,467 INFO L85 PathProgramCache]: Analyzing trace with hash -491940965, now seen corresponding path program 1 times [2024-11-10 18:06:07,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:06:07,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466551303] [2024-11-10 18:06:07,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:06:07,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:06:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:06:08,158 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-10 18:06:08,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:06:08,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466551303] [2024-11-10 18:06:08,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466551303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:06:08,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:06:08,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 18:06:08,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726280635] [2024-11-10 18:06:08,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:06:08,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 18:06:08,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:06:08,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 18:06:08,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:06:08,842 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 74 [2024-11-10 18:06:08,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 62 transitions, 245 flow. Second operand has 13 states, 13 states have (on average 37.38461538461539) internal successors, (486), 13 states have internal predecessors, (486), 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-11-10 18:06:08,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:06:08,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 74 [2024-11-10 18:06:08,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:06:09,182 INFO L124 PetriNetUnfolderBase]: 124/387 cut-off events. [2024-11-10 18:06:09,183 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2024-11-10 18:06:09,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 833 conditions, 387 events. 124/387 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1727 event pairs, 20 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 814. Up to 129 conditions per place. [2024-11-10 18:06:09,185 INFO L140 encePairwiseOnDemand]: 60/74 looper letters, 55 selfloop transitions, 17 changer transitions 0/84 dead transitions. [2024-11-10 18:06:09,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 84 transitions, 433 flow [2024-11-10 18:06:09,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 18:06:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-10 18:06:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 531 transitions. [2024-11-10 18:06:09,187 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5519750519750519 [2024-11-10 18:06:09,187 INFO L175 Difference]: Start difference. First operand has 85 places, 62 transitions, 245 flow. Second operand 13 states and 531 transitions. [2024-11-10 18:06:09,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 84 transitions, 433 flow [2024-11-10 18:06:09,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 84 transitions, 420 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-10 18:06:09,189 INFO L231 Difference]: Finished difference. Result has 93 places, 63 transitions, 289 flow [2024-11-10 18:06:09,189 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=289, PETRI_PLACES=93, PETRI_TRANSITIONS=63} [2024-11-10 18:06:09,189 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 18 predicate places. [2024-11-10 18:06:09,190 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 63 transitions, 289 flow [2024-11-10 18:06:09,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 37.38461538461539) internal successors, (486), 13 states have internal predecessors, (486), 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-11-10 18:06:09,190 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:06:09,190 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:06:09,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 18:06:09,190 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 18:06:09,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:06:09,191 INFO L85 PathProgramCache]: Analyzing trace with hash -120255692, now seen corresponding path program 1 times [2024-11-10 18:06:09,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:06:09,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012023108] [2024-11-10 18:06:09,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:06:09,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:06:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:06:09,567 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-10 18:06:09,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:06:09,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012023108] [2024-11-10 18:06:09,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012023108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:06:09,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:06:09,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 18:06:09,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723250010] [2024-11-10 18:06:09,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:06:09,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 18:06:09,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:06:09,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 18:06:09,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 18:06:09,856 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 74 [2024-11-10 18:06:09,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 63 transitions, 289 flow. Second operand has 8 states, 8 states have (on average 38.875) internal successors, (311), 8 states have internal predecessors, (311), 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-11-10 18:06:09,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:06:09,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 74 [2024-11-10 18:06:09,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:06:09,977 INFO L124 PetriNetUnfolderBase]: 100/321 cut-off events. [2024-11-10 18:06:09,978 INFO L125 PetriNetUnfolderBase]: For 232/234 co-relation queries the response was YES. [2024-11-10 18:06:09,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 321 events. 100/321 cut-off events. For 232/234 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1379 event pairs, 60 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 767. Up to 208 conditions per place. [2024-11-10 18:06:09,979 INFO L140 encePairwiseOnDemand]: 67/74 looper letters, 44 selfloop transitions, 6 changer transitions 0/70 dead transitions. [2024-11-10 18:06:09,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 70 transitions, 425 flow [2024-11-10 18:06:09,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:06:09,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:06:09,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 221 transitions. [2024-11-10 18:06:09,982 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5972972972972973 [2024-11-10 18:06:09,982 INFO L175 Difference]: Start difference. First operand has 93 places, 63 transitions, 289 flow. Second operand 5 states and 221 transitions. [2024-11-10 18:06:09,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 70 transitions, 425 flow [2024-11-10 18:06:09,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 70 transitions, 398 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-11-10 18:06:09,984 INFO L231 Difference]: Finished difference. Result has 86 places, 62 transitions, 277 flow [2024-11-10 18:06:09,985 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=277, PETRI_PLACES=86, PETRI_TRANSITIONS=62} [2024-11-10 18:06:09,985 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 11 predicate places. [2024-11-10 18:06:09,985 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 62 transitions, 277 flow [2024-11-10 18:06:09,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 38.875) internal successors, (311), 8 states have internal predecessors, (311), 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-11-10 18:06:09,986 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:06:09,986 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:06:09,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 18:06:09,986 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 18:06:09,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:06:09,986 INFO L85 PathProgramCache]: Analyzing trace with hash 567041396, now seen corresponding path program 1 times [2024-11-10 18:06:09,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:06:09,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042561963] [2024-11-10 18:06:09,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:06:09,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:06:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:06:10,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:06:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:06:10,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 18:06:10,280 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:06:10,281 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 50 remaining) [2024-11-10 18:06:10,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2024-11-10 18:06:10,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2024-11-10 18:06:10,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2024-11-10 18:06:10,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2024-11-10 18:06:10,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2024-11-10 18:06:10,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2024-11-10 18:06:10,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2024-11-10 18:06:10,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2024-11-10 18:06:10,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2024-11-10 18:06:10,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2024-11-10 18:06:10,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2024-11-10 18:06:10,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2024-11-10 18:06:10,285 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2024-11-10 18:06:10,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2024-11-10 18:06:10,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2024-11-10 18:06:10,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2024-11-10 18:06:10,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2024-11-10 18:06:10,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2024-11-10 18:06:10,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2024-11-10 18:06:10,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2024-11-10 18:06:10,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2024-11-10 18:06:10,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2024-11-10 18:06:10,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2024-11-10 18:06:10,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2024-11-10 18:06:10,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (24 of 50 remaining) [2024-11-10 18:06:10,286 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 50 remaining) [2024-11-10 18:06:10,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2024-11-10 18:06:10,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2024-11-10 18:06:10,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2024-11-10 18:06:10,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2024-11-10 18:06:10,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2024-11-10 18:06:10,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2024-11-10 18:06:10,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2024-11-10 18:06:10,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2024-11-10 18:06:10,287 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2024-11-10 18:06:10,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2024-11-10 18:06:10,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2024-11-10 18:06:10,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2024-11-10 18:06:10,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2024-11-10 18:06:10,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2024-11-10 18:06:10,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2024-11-10 18:06:10,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2024-11-10 18:06:10,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2024-11-10 18:06:10,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2024-11-10 18:06:10,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2024-11-10 18:06:10,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2024-11-10 18:06:10,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2024-11-10 18:06:10,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2024-11-10 18:06:10,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 50 remaining) [2024-11-10 18:06:10,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 18:06:10,308 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:06:10,358 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 18:06:10,358 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:06:10,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:06:10 BasicIcfg [2024-11-10 18:06:10,363 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:06:10,364 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:06:10,364 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:06:10,364 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:06:10,365 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:05:58" (3/4) ... [2024-11-10 18:06:10,366 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 18:06:10,417 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 18:06:10,417 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:06:10,417 INFO L158 Benchmark]: Toolchain (without parser) took 13755.13ms. Allocated memory was 165.7MB in the beginning and 423.6MB in the end (delta: 257.9MB). Free memory was 108.5MB in the beginning and 370.5MB in the end (delta: -261.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:06:10,417 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 165.7MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:06:10,417 INFO L158 Benchmark]: CACSL2BoogieTranslator took 689.25ms. Allocated memory is still 165.7MB. Free memory was 108.5MB in the beginning and 63.7MB in the end (delta: 44.8MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-10 18:06:10,418 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.52ms. Allocated memory is still 165.7MB. Free memory was 63.7MB in the beginning and 60.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:06:10,418 INFO L158 Benchmark]: Boogie Preprocessor took 62.09ms. Allocated memory is still 165.7MB. Free memory was 59.7MB in the beginning and 56.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:06:10,418 INFO L158 Benchmark]: IcfgBuilder took 922.40ms. Allocated memory was 165.7MB in the beginning and 243.3MB in the end (delta: 77.6MB). Free memory was 56.1MB in the beginning and 184.7MB in the end (delta: -128.5MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2024-11-10 18:06:10,418 INFO L158 Benchmark]: TraceAbstraction took 11946.06ms. Allocated memory was 243.3MB in the beginning and 423.6MB in the end (delta: 180.4MB). Free memory was 183.6MB in the beginning and 376.8MB in the end (delta: -193.2MB). Peak memory consumption was 229.4MB. Max. memory is 16.1GB. [2024-11-10 18:06:10,418 INFO L158 Benchmark]: Witness Printer took 53.03ms. Allocated memory is still 423.6MB. Free memory was 376.8MB in the beginning and 370.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 18:06:10,420 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.31ms. Allocated memory is still 165.7MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 689.25ms. Allocated memory is still 165.7MB. Free memory was 108.5MB in the beginning and 63.7MB in the end (delta: 44.8MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.52ms. Allocated memory is still 165.7MB. Free memory was 63.7MB in the beginning and 60.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.09ms. Allocated memory is still 165.7MB. Free memory was 59.7MB in the beginning and 56.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 922.40ms. Allocated memory was 165.7MB in the beginning and 243.3MB in the end (delta: 77.6MB). Free memory was 56.1MB in the beginning and 184.7MB in the end (delta: -128.5MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11946.06ms. Allocated memory was 243.3MB in the beginning and 423.6MB in the end (delta: 180.4MB). Free memory was 183.6MB in the beginning and 376.8MB in the end (delta: -193.2MB). Peak memory consumption was 229.4MB. Max. memory is 16.1GB. * Witness Printer took 53.03ms. Allocated memory is still 423.6MB. Free memory was 376.8MB in the beginning and 370.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1254] 0 int i = 0; VAL [i=0, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=1, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=2, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=3, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=4, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=5, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=6, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=7, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=8, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=9, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=10, mutex={1:0}, slot={2:0}] [L1254] COND FALSE 0 !(i < 10) VAL [i=10, mutex={1:0}, slot={2:0}] [L1256] 0 int j = __VERIFIER_nondet_int(); [L1257] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1257] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1258] 0 struct s *p; [L1259] 0 pthread_t t1; [L1260] 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; [L1260] RET, EXPR 0 new(1) [L1260] 0 slot[j] = new(1) [L1261] 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; [L1261] RET, EXPR 0 new(2) [L1261] EXPR 0 slot[j] [L1261] 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 [L1261] RET 0 list_add(new(2), slot[j]) [L1262] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [j=5, 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=3, 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: 1262]: 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, 98 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: 11.8s, OverallIterations: 19, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3125 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2310 mSDsluCounter, 1583 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1530 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8500 IncrementalHoareTripleChecker+Invalid, 8627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 53 mSDtfsCounter, 8500 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=289occurred in iteration=17, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 557 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 514 ConstructedInterpolants, 0 QuantifiedInterpolants, 3133 SizeOfPredicates, 0 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 1450/1516 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-11-10 18:06:10,449 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)