./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d 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_19-nested_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 12bbf3623faa1d8cb0ae406b9406d293839854c20d2fb62622ec841c419248fb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:25:55,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:25:55,795 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 03:25:55,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:25:55,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:25:55,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:25:55,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:25:55,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:25:55,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:25:55,814 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:25:55,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:25:55,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:25:55,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:25:55,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:25:55,816 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:25:55,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:25:55,816 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:25:55,816 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:25:55,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:25:55,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:25:55,817 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:25:55,817 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:25:55,817 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:25:55,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:25:55,818 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:25:55,818 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:25:55,818 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:25:55,819 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:25:55,819 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:25:55,819 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:25:55,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:25:55,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:25:55,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:25:55,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:25:55,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:25:55,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:25:55,820 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 03:25:55,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 03:25:55,821 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:25:55,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:25:55,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:25:55,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:25:55,822 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 -> 12bbf3623faa1d8cb0ae406b9406d293839854c20d2fb62622ec841c419248fb [2024-11-17 03:25:56,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:25:56,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:25:56,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:25:56,180 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:25:56,181 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:25:56,182 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr-deref.i [2024-11-17 03:25:57,569 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:25:57,812 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:25:57,812 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr-deref.i [2024-11-17 03:25:57,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7428f552/5c7e5189dd494adb975c2fc311370adb/FLAGbb895bac8 [2024-11-17 03:25:57,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7428f552/5c7e5189dd494adb975c2fc311370adb [2024-11-17 03:25:57,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:25:57,840 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:25:57,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:25:57,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:25:57,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:25:57,855 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:25:57" (1/1) ... [2024-11-17 03:25:57,856 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e7d90cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:57, skipping insertion in model container [2024-11-17 03:25:57,856 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:25:57" (1/1) ... [2024-11-17 03:25:57,940 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:25:58,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:25:58,636 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:25:58,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:25:58,849 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:25:58,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:58 WrapperNode [2024-11-17 03:25:58,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:25:58,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:25:58,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:25:58,851 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:25:58,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:58" (1/1) ... [2024-11-17 03:25:58,879 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:58" (1/1) ... [2024-11-17 03:25:58,912 INFO L138 Inliner]: procedures = 372, calls = 87, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 176 [2024-11-17 03:25:58,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:25:58,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:25:58,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:25:58,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:25:58,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:58" (1/1) ... [2024-11-17 03:25:58,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:58" (1/1) ... [2024-11-17 03:25:58,931 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:58" (1/1) ... [2024-11-17 03:25:58,956 INFO L175 MemorySlicer]: Split 78 memory accesses to 2 slices as follows [64, 14]. 82 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [60, 0]. The 11 writes are split as follows [1, 10]. [2024-11-17 03:25:58,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:58" (1/1) ... [2024-11-17 03:25:58,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:58" (1/1) ... [2024-11-17 03:25:58,973 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:58" (1/1) ... [2024-11-17 03:25:58,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:58" (1/1) ... [2024-11-17 03:25:58,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:58" (1/1) ... [2024-11-17 03:25:58,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:58" (1/1) ... [2024-11-17 03:25:58,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:25:58,986 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:25:58,987 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:25:58,987 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:25:58,987 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:58" (1/1) ... [2024-11-17 03:25:58,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:25:59,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:25:59,016 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-17 03:25:59,022 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-17 03:25:59,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 03:25:59,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 03:25:59,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-17 03:25:59,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-17 03:25:59,070 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-17 03:25:59,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 03:25:59,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 03:25:59,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 03:25:59,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 03:25:59,070 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-17 03:25:59,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 03:25:59,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:25:59,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 03:25:59,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 03:25:59,070 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-17 03:25:59,070 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-17 03:25:59,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 03:25:59,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 03:25:59,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:25:59,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:25:59,072 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:25:59,186 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:25:59,187 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:25:59,463 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:25:59,464 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:25:59,718 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:25:59,723 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:25:59,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:25:59 BoogieIcfgContainer [2024-11-17 03:25:59,724 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:25:59,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:25:59,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:25:59,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:25:59,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:25:57" (1/3) ... [2024-11-17 03:25:59,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be9ccdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:25:59, skipping insertion in model container [2024-11-17 03:25:59,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:25:58" (2/3) ... [2024-11-17 03:25:59,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be9ccdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:25:59, skipping insertion in model container [2024-11-17 03:25:59,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:25:59" (3/3) ... [2024-11-17 03:25:59,732 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_19-nested_nr-deref.i [2024-11-17 03:25:59,744 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:25:59,744 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-11-17 03:25:59,745 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:25:59,790 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-17 03:25:59,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 74 transitions, 152 flow [2024-11-17 03:25:59,850 INFO L124 PetriNetUnfolderBase]: 2/73 cut-off events. [2024-11-17 03:25:59,850 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:25:59,852 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 164 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-17 03:25:59,853 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 74 transitions, 152 flow [2024-11-17 03:25:59,856 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 73 transitions, 149 flow [2024-11-17 03:25:59,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:25:59,871 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;@3c34fc57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:25:59,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-17 03:25:59,877 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:25:59,877 INFO L124 PetriNetUnfolderBase]: 2/7 cut-off events. [2024-11-17 03:25:59,877 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:25:59,879 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:25:59,880 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-17 03:25:59,880 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-17 03:25:59,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:25:59,884 INFO L85 PathProgramCache]: Analyzing trace with hash 15855201, now seen corresponding path program 1 times [2024-11-17 03:25:59,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:25:59,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781622298] [2024-11-17 03:25:59,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:25:59,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:00,120 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-17 03:26:00,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:00,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781622298] [2024-11-17 03:26:00,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781622298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:00,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:00,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:26:00,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439658659] [2024-11-17 03:26:00,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:00,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 03:26:00,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:00,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 03:26:00,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 03:26:00,191 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 74 [2024-11-17 03:26:00,194 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-17 03:26:00,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:00,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 74 [2024-11-17 03:26:00,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:00,285 INFO L124 PetriNetUnfolderBase]: 64/267 cut-off events. [2024-11-17 03:26:00,285 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:26:00,286 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 1199 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-17 03:26:00,288 INFO L140 encePairwiseOnDemand]: 73/74 looper letters, 26 selfloop transitions, 0 changer transitions 0/72 dead transitions. [2024-11-17 03:26:00,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 72 transitions, 199 flow [2024-11-17 03:26:00,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 03:26:00,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-17 03:26:00,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 121 transitions. [2024-11-17 03:26:00,298 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8175675675675675 [2024-11-17 03:26:00,299 INFO L175 Difference]: Start difference. First operand has 75 places, 73 transitions, 149 flow. Second operand 2 states and 121 transitions. [2024-11-17 03:26:00,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 72 transitions, 199 flow [2024-11-17 03:26:00,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 72 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:26:00,303 INFO L231 Difference]: Finished difference. Result has 75 places, 72 transitions, 146 flow [2024-11-17 03:26:00,304 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-17 03:26:00,307 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 0 predicate places. [2024-11-17 03:26:00,307 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 72 transitions, 146 flow [2024-11-17 03:26:00,307 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-17 03:26:00,308 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:00,308 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-17 03:26:00,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 03:26:00,308 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-17 03:26:00,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:00,308 INFO L85 PathProgramCache]: Analyzing trace with hash 491490619, now seen corresponding path program 1 times [2024-11-17 03:26:00,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:00,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650349571] [2024-11-17 03:26:00,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:00,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:00,425 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-17 03:26:00,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:00,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650349571] [2024-11-17 03:26:00,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650349571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:00,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:00,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:26:00,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740049248] [2024-11-17 03:26:00,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:00,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:26:00,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:00,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:26:00,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:26:00,428 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 74 [2024-11-17 03:26:00,429 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-17 03:26:00,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:00,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 74 [2024-11-17 03:26:00,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:00,535 INFO L124 PetriNetUnfolderBase]: 64/269 cut-off events. [2024-11-17 03:26:00,535 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:26:00,536 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 1193 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-17 03:26:00,537 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 26 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2024-11-17 03:26:00,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 73 transitions, 204 flow [2024-11-17 03:26:00,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:26:00,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:26:00,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2024-11-17 03:26:00,542 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7522522522522522 [2024-11-17 03:26:00,542 INFO L175 Difference]: Start difference. First operand has 75 places, 72 transitions, 146 flow. Second operand 3 states and 167 transitions. [2024-11-17 03:26:00,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 73 transitions, 204 flow [2024-11-17 03:26:00,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 73 transitions, 204 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-17 03:26:00,544 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 158 flow [2024-11-17 03:26:00,545 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-17 03:26:00,546 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 3 predicate places. [2024-11-17 03:26:00,546 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 158 flow [2024-11-17 03:26:00,546 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-17 03:26:00,547 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:00,547 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-17 03:26:00,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 03:26:00,548 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-17 03:26:00,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:00,549 INFO L85 PathProgramCache]: Analyzing trace with hash -122491915, now seen corresponding path program 1 times [2024-11-17 03:26:00,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:00,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119671985] [2024-11-17 03:26:00,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:00,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:00,624 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-17 03:26:00,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:00,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119671985] [2024-11-17 03:26:00,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119671985] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:26:00,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051946714] [2024-11-17 03:26:00,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:00,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:26:00,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:26:00,633 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-17 03:26:00,634 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-17 03:26:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:00,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:26:00,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:26:00,801 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-17 03:26:00,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:26:00,831 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-17 03:26:00,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051946714] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:26:00,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:26:00,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-17 03:26:00,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351322565] [2024-11-17 03:26:00,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:26:00,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:26:00,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:00,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:26:00,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:26:00,836 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 74 [2024-11-17 03:26:00,837 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-17 03:26:00,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:00,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 74 [2024-11-17 03:26:00,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:00,946 INFO L124 PetriNetUnfolderBase]: 64/275 cut-off events. [2024-11-17 03:26:00,946 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-17 03:26:00,948 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 1200 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-17 03:26:00,950 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 26 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2024-11-17 03:26:00,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 76 transitions, 232 flow [2024-11-17 03:26:00,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:26:00,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:26:00,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 310 transitions. [2024-11-17 03:26:00,954 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6981981981981982 [2024-11-17 03:26:00,956 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 158 flow. Second operand 6 states and 310 transitions. [2024-11-17 03:26:00,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 76 transitions, 232 flow [2024-11-17 03:26:00,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 76 transitions, 230 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:26:00,957 INFO L231 Difference]: Finished difference. Result has 85 places, 76 transitions, 192 flow [2024-11-17 03:26:00,958 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-17 03:26:00,959 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2024-11-17 03:26:00,959 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 76 transitions, 192 flow [2024-11-17 03:26:00,959 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-17 03:26:00,960 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:00,960 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1] [2024-11-17 03:26:00,976 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-17 03:26:01,161 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-17 03:26:01,162 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-17 03:26:01,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:01,162 INFO L85 PathProgramCache]: Analyzing trace with hash 162717987, now seen corresponding path program 2 times [2024-11-17 03:26:01,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:01,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027247121] [2024-11-17 03:26:01,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:01,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:01,278 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-17 03:26:01,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:01,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027247121] [2024-11-17 03:26:01,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027247121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:01,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:01,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:26:01,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423001454] [2024-11-17 03:26:01,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:01,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:26:01,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:01,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:26:01,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:26:01,360 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 74 [2024-11-17 03:26:01,360 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-17 03:26:01,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:01,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 74 [2024-11-17 03:26:01,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:01,488 INFO L124 PetriNetUnfolderBase]: 64/271 cut-off events. [2024-11-17 03:26:01,488 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-17 03:26:01,489 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 1178 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-17 03:26:01,490 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 28 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2024-11-17 03:26:01,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 72 transitions, 248 flow [2024-11-17 03:26:01,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:26:01,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:26:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2024-11-17 03:26:01,491 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6981981981981982 [2024-11-17 03:26:01,492 INFO L175 Difference]: Start difference. First operand has 85 places, 76 transitions, 192 flow. Second operand 3 states and 155 transitions. [2024-11-17 03:26:01,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 72 transitions, 248 flow [2024-11-17 03:26:01,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 72 transitions, 240 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-17 03:26:01,494 INFO L231 Difference]: Finished difference. Result has 82 places, 72 transitions, 184 flow [2024-11-17 03:26:01,494 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-17 03:26:01,495 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 7 predicate places. [2024-11-17 03:26:01,495 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 72 transitions, 184 flow [2024-11-17 03:26:01,495 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-17 03:26:01,495 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:01,495 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1] [2024-11-17 03:26:01,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 03:26:01,495 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-17 03:26:01,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:01,496 INFO L85 PathProgramCache]: Analyzing trace with hash 162717988, now seen corresponding path program 1 times [2024-11-17 03:26:01,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:01,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200163488] [2024-11-17 03:26:01,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:01,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:01,567 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-17 03:26:01,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:01,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200163488] [2024-11-17 03:26:01,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200163488] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 03:26:01,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002167131] [2024-11-17 03:26:01,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:01,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 03:26:01,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:26:01,573 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-17 03:26:01,578 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-17 03:26:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:01,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 03:26:01,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:26:01,748 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-17 03:26:01,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 03:26:01,806 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-17 03:26:01,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002167131] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 03:26:01,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 03:26:01,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-17 03:26:01,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734334165] [2024-11-17 03:26:01,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 03:26:01,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 03:26:01,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:01,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 03:26:01,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-17 03:26:01,811 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 74 [2024-11-17 03:26:01,813 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-17 03:26:01,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:01,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 74 [2024-11-17 03:26:01,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:02,003 INFO L124 PetriNetUnfolderBase]: 64/283 cut-off events. [2024-11-17 03:26:02,003 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2024-11-17 03:26:02,004 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 1174 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-17 03:26:02,010 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 26 selfloop transitions, 11 changer transitions 0/78 dead transitions. [2024-11-17 03:26:02,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 78 transitions, 294 flow [2024-11-17 03:26:02,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 03:26:02,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-17 03:26:02,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 595 transitions. [2024-11-17 03:26:02,017 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.670045045045045 [2024-11-17 03:26:02,017 INFO L175 Difference]: Start difference. First operand has 82 places, 72 transitions, 184 flow. Second operand 12 states and 595 transitions. [2024-11-17 03:26:02,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 78 transitions, 294 flow [2024-11-17 03:26:02,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 78 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:26:02,021 INFO L231 Difference]: Finished difference. Result has 97 places, 78 transitions, 260 flow [2024-11-17 03:26:02,021 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-17 03:26:02,022 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 22 predicate places. [2024-11-17 03:26:02,022 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 78 transitions, 260 flow [2024-11-17 03:26:02,022 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-17 03:26:02,022 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:02,022 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1] [2024-11-17 03:26:02,039 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-17 03:26:02,223 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-17 03:26:02,223 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-17 03:26:02,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:02,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1026991104, now seen corresponding path program 2 times [2024-11-17 03:26:02,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:02,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575676994] [2024-11-17 03:26:02,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:02,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:02,351 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-17 03:26:02,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:02,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575676994] [2024-11-17 03:26:02,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575676994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:02,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:02,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:26:02,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702686320] [2024-11-17 03:26:02,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:02,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:26:02,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:02,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:26:02,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:26:02,398 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 74 [2024-11-17 03:26:02,398 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-17 03:26:02,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:02,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 74 [2024-11-17 03:26:02,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:02,479 INFO L124 PetriNetUnfolderBase]: 64/279 cut-off events. [2024-11-17 03:26:02,479 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2024-11-17 03:26:02,480 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 1167 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-17 03:26:02,481 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 32 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2024-11-17 03:26:02,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 74 transitions, 324 flow [2024-11-17 03:26:02,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:26:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:26:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2024-11-17 03:26:02,483 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2024-11-17 03:26:02,483 INFO L175 Difference]: Start difference. First operand has 97 places, 78 transitions, 260 flow. Second operand 3 states and 159 transitions. [2024-11-17 03:26:02,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 74 transitions, 324 flow [2024-11-17 03:26:02,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 74 transitions, 288 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-11-17 03:26:02,486 INFO L231 Difference]: Finished difference. Result has 90 places, 74 transitions, 224 flow [2024-11-17 03:26:02,486 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-17 03:26:02,487 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 15 predicate places. [2024-11-17 03:26:02,487 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 74 transitions, 224 flow [2024-11-17 03:26:02,487 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-17 03:26:02,487 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:02,488 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2024-11-17 03:26:02,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 03:26:02,488 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-17 03:26:02,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:02,488 INFO L85 PathProgramCache]: Analyzing trace with hash 904041024, now seen corresponding path program 1 times [2024-11-17 03:26:02,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:02,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448537076] [2024-11-17 03:26:02,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:02,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:02,675 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-17 03:26:02,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:02,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448537076] [2024-11-17 03:26:02,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448537076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:02,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:02,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:26:02,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904224525] [2024-11-17 03:26:02,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:02,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:26:02,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:02,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:26:02,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:26:02,818 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 74 [2024-11-17 03:26:02,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 74 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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-17 03:26:02,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:02,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 74 [2024-11-17 03:26:02,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:02,929 INFO L124 PetriNetUnfolderBase]: 64/267 cut-off events. [2024-11-17 03:26:02,929 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-11-17 03:26:02,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 267 events. 64/267 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. 10/231 useless extension candidates. Maximal degree in co-relation 468. Up to 129 conditions per place. [2024-11-17 03:26:02,930 INFO L140 encePairwiseOnDemand]: 61/74 looper letters, 36 selfloop transitions, 6 changer transitions 3/76 dead transitions. [2024-11-17 03:26:02,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 76 transitions, 318 flow [2024-11-17 03:26:02,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:26:02,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:26:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 243 transitions. [2024-11-17 03:26:02,931 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6567567567567567 [2024-11-17 03:26:02,932 INFO L175 Difference]: Start difference. First operand has 90 places, 74 transitions, 224 flow. Second operand 5 states and 243 transitions. [2024-11-17 03:26:02,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 76 transitions, 318 flow [2024-11-17 03:26:02,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 76 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:26:02,934 INFO L231 Difference]: Finished difference. Result has 85 places, 67 transitions, 214 flow [2024-11-17 03:26:02,934 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-17 03:26:02,934 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2024-11-17 03:26:02,935 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 67 transitions, 214 flow [2024-11-17 03:26:02,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 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-17 03:26:02,935 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:02,935 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:26:02,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 03:26:02,935 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-17 03:26:02,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:02,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2102381375, now seen corresponding path program 1 times [2024-11-17 03:26:02,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:02,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119324297] [2024-11-17 03:26:02,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:02,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:03,161 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-17 03:26:03,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:03,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119324297] [2024-11-17 03:26:03,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119324297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:03,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:03,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:26:03,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138460947] [2024-11-17 03:26:03,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:03,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 03:26:03,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:03,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 03:26:03,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 03:26:03,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 74 [2024-11-17 03:26:03,354 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-17 03:26:03,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:03,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 74 [2024-11-17 03:26:03,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:03,514 INFO L124 PetriNetUnfolderBase]: 64/265 cut-off events. [2024-11-17 03:26:03,515 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-11-17 03:26:03,515 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 1083 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-17 03:26:03,516 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 38 selfloop transitions, 7 changer transitions 3/74 dead transitions. [2024-11-17 03:26:03,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 74 transitions, 324 flow [2024-11-17 03:26:03,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 03:26:03,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-17 03:26:03,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 306 transitions. [2024-11-17 03:26:03,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5907335907335908 [2024-11-17 03:26:03,521 INFO L175 Difference]: Start difference. First operand has 85 places, 67 transitions, 214 flow. Second operand 7 states and 306 transitions. [2024-11-17 03:26:03,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 74 transitions, 324 flow [2024-11-17 03:26:03,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 74 transitions, 312 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:26:03,523 INFO L231 Difference]: Finished difference. Result has 85 places, 65 transitions, 212 flow [2024-11-17 03:26:03,523 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-17 03:26:03,524 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2024-11-17 03:26:03,524 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 65 transitions, 212 flow [2024-11-17 03:26:03,524 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-17 03:26:03,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:03,526 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:26:03,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 03:26:03,526 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-17 03:26:03,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:03,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2102381374, now seen corresponding path program 1 times [2024-11-17 03:26:03,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:03,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664259071] [2024-11-17 03:26:03,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:03,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:03,937 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-17 03:26:03,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:03,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664259071] [2024-11-17 03:26:03,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664259071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:03,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:03,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:26:03,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409649926] [2024-11-17 03:26:03,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:03,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:26:03,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:03,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:26:03,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:26:04,108 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 74 [2024-11-17 03:26:04,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 65 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 42.333333333333336) internal successors, (254), 6 states have internal predecessors, (254), 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-17 03:26:04,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:04,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 74 [2024-11-17 03:26:04,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:04,235 INFO L124 PetriNetUnfolderBase]: 64/263 cut-off events. [2024-11-17 03:26:04,235 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2024-11-17 03:26:04,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 263 events. 64/263 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1078 event pairs, 54 based on Foata normal form. 1/221 useless extension candidates. Maximal degree in co-relation 476. Up to 126 conditions per place. [2024-11-17 03:26:04,236 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 35 selfloop transitions, 7 changer transitions 3/72 dead transitions. [2024-11-17 03:26:04,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 72 transitions, 316 flow [2024-11-17 03:26:04,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 03:26:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-17 03:26:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 324 transitions. [2024-11-17 03:26:04,237 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6254826254826255 [2024-11-17 03:26:04,237 INFO L175 Difference]: Start difference. First operand has 85 places, 65 transitions, 212 flow. Second operand 7 states and 324 transitions. [2024-11-17 03:26:04,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 72 transitions, 316 flow [2024-11-17 03:26:04,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 72 transitions, 302 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-17 03:26:04,239 INFO L231 Difference]: Finished difference. Result has 83 places, 63 transitions, 208 flow [2024-11-17 03:26:04,239 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-17 03:26:04,240 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 8 predicate places. [2024-11-17 03:26:04,240 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 63 transitions, 208 flow [2024-11-17 03:26:04,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.333333333333336) internal successors, (254), 6 states have internal predecessors, (254), 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-17 03:26:04,240 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:04,240 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:26:04,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 03:26:04,241 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-17 03:26:04,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:04,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1753854367, now seen corresponding path program 1 times [2024-11-17 03:26:04,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:04,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957752675] [2024-11-17 03:26:04,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:04,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:04,409 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-17 03:26:04,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:04,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957752675] [2024-11-17 03:26:04,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957752675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:04,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:04,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:26:04,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208076780] [2024-11-17 03:26:04,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:04,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:26:04,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:04,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:26:04,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:26:04,491 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 74 [2024-11-17 03:26:04,491 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-17 03:26:04,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:04,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 74 [2024-11-17 03:26:04,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:04,617 INFO L124 PetriNetUnfolderBase]: 64/262 cut-off events. [2024-11-17 03:26:04,617 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2024-11-17 03:26:04,618 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 1074 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-17 03:26:04,619 INFO L140 encePairwiseOnDemand]: 67/74 looper letters, 30 selfloop transitions, 6 changer transitions 0/62 dead transitions. [2024-11-17 03:26:04,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 62 transitions, 278 flow [2024-11-17 03:26:04,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:26:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:26:04,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 237 transitions. [2024-11-17 03:26:04,620 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6405405405405405 [2024-11-17 03:26:04,620 INFO L175 Difference]: Start difference. First operand has 83 places, 63 transitions, 208 flow. Second operand 5 states and 237 transitions. [2024-11-17 03:26:04,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 62 transitions, 278 flow [2024-11-17 03:26:04,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 62 transitions, 264 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-17 03:26:04,622 INFO L231 Difference]: Finished difference. Result has 80 places, 62 transitions, 204 flow [2024-11-17 03:26:04,622 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-17 03:26:04,622 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 5 predicate places. [2024-11-17 03:26:04,622 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 62 transitions, 204 flow [2024-11-17 03:26:04,623 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-17 03:26:04,623 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:04,623 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:26:04,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 03:26:04,623 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-17 03:26:04,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:04,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1753854368, now seen corresponding path program 1 times [2024-11-17 03:26:04,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:04,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199971770] [2024-11-17 03:26:04,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:04,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:04,770 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-17 03:26:04,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:04,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199971770] [2024-11-17 03:26:04,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199971770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:04,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:04,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:26:04,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598852330] [2024-11-17 03:26:04,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:04,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:26:04,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:04,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:26:04,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:26:04,992 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 74 [2024-11-17 03:26:04,996 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-17 03:26:04,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:04,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 74 [2024-11-17 03:26:04,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:05,184 INFO L124 PetriNetUnfolderBase]: 64/261 cut-off events. [2024-11-17 03:26:05,185 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-11-17 03:26:05,187 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 1073 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-17 03:26:05,188 INFO L140 encePairwiseOnDemand]: 67/74 looper letters, 32 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2024-11-17 03:26:05,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 61 transitions, 278 flow [2024-11-17 03:26:05,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:26:05,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:26:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 229 transitions. [2024-11-17 03:26:05,191 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6189189189189189 [2024-11-17 03:26:05,191 INFO L175 Difference]: Start difference. First operand has 80 places, 62 transitions, 204 flow. Second operand 5 states and 229 transitions. [2024-11-17 03:26:05,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 61 transitions, 278 flow [2024-11-17 03:26:05,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 61 transitions, 266 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:26:05,193 INFO L231 Difference]: Finished difference. Result has 79 places, 61 transitions, 202 flow [2024-11-17 03:26:05,194 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-17 03:26:05,195 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 4 predicate places. [2024-11-17 03:26:05,195 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 61 transitions, 202 flow [2024-11-17 03:26:05,195 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-17 03:26:05,195 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:05,196 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-17 03:26:05,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 03:26:05,196 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-17 03:26:05,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:05,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2122147087, now seen corresponding path program 1 times [2024-11-17 03:26:05,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:05,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001374261] [2024-11-17 03:26:05,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:05,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:05,291 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-17 03:26:05,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:05,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001374261] [2024-11-17 03:26:05,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001374261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:05,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:05,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:26:05,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528799370] [2024-11-17 03:26:05,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:05,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:26:05,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:05,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:26:05,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:26:05,328 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2024-11-17 03:26:05,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 61 transitions, 202 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-17 03:26:05,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:05,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2024-11-17 03:26:05,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:05,397 INFO L124 PetriNetUnfolderBase]: 71/271 cut-off events. [2024-11-17 03:26:05,397 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-11-17 03:26:05,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 271 events. 71/271 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1133 event pairs, 56 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 489. Up to 148 conditions per place. [2024-11-17 03:26:05,398 INFO L140 encePairwiseOnDemand]: 70/74 looper letters, 42 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-11-17 03:26:05,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 66 transitions, 300 flow [2024-11-17 03:26:05,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:26:05,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:26:05,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2024-11-17 03:26:05,400 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7567567567567568 [2024-11-17 03:26:05,400 INFO L175 Difference]: Start difference. First operand has 79 places, 61 transitions, 202 flow. Second operand 3 states and 168 transitions. [2024-11-17 03:26:05,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 66 transitions, 300 flow [2024-11-17 03:26:05,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 66 transitions, 288 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:26:05,401 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 190 flow [2024-11-17 03:26:05,402 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-17 03:26:05,402 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 0 predicate places. [2024-11-17 03:26:05,402 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 190 flow [2024-11-17 03:26:05,404 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-17 03:26:05,404 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:05,404 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-17 03:26:05,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 03:26:05,404 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-17 03:26:05,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:05,404 INFO L85 PathProgramCache]: Analyzing trace with hash -2122147086, now seen corresponding path program 1 times [2024-11-17 03:26:05,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:05,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102359690] [2024-11-17 03:26:05,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:05,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:05,501 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-17 03:26:05,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:05,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102359690] [2024-11-17 03:26:05,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102359690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:05,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:05,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:26:05,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904219154] [2024-11-17 03:26:05,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:05,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:26:05,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:05,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:26:05,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:26:05,573 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 74 [2024-11-17 03:26:05,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 190 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-17 03:26:05,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:05,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 74 [2024-11-17 03:26:05,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:05,664 INFO L124 PetriNetUnfolderBase]: 64/248 cut-off events. [2024-11-17 03:26:05,665 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2024-11-17 03:26:05,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 248 events. 64/248 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 957 event pairs, 56 based on Foata normal form. 16/235 useless extension candidates. Maximal degree in co-relation 461. Up to 148 conditions per place. [2024-11-17 03:26:05,666 INFO L140 encePairwiseOnDemand]: 70/74 looper letters, 41 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-11-17 03:26:05,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 64 transitions, 286 flow [2024-11-17 03:26:05,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:26:05,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:26:05,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2024-11-17 03:26:05,672 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7657657657657657 [2024-11-17 03:26:05,672 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 190 flow. Second operand 3 states and 170 transitions. [2024-11-17 03:26:05,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 64 transitions, 286 flow [2024-11-17 03:26:05,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 64 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:26:05,673 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 186 flow [2024-11-17 03:26:05,673 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-17 03:26:05,674 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, -2 predicate places. [2024-11-17 03:26:05,674 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 186 flow [2024-11-17 03:26:05,674 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-17 03:26:05,674 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:05,674 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-17 03:26:05,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 03:26:05,675 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-17 03:26:05,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:05,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1390270549, now seen corresponding path program 1 times [2024-11-17 03:26:05,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:05,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137640753] [2024-11-17 03:26:05,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:05,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:05,992 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-17 03:26:05,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:05,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137640753] [2024-11-17 03:26:05,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137640753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:05,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:05,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 03:26:05,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063383283] [2024-11-17 03:26:05,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:05,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 03:26:05,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:05,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 03:26:05,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-17 03:26:06,362 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 74 [2024-11-17 03:26:06,363 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-17 03:26:06,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:06,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 74 [2024-11-17 03:26:06,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:06,521 INFO L124 PetriNetUnfolderBase]: 73/268 cut-off events. [2024-11-17 03:26:06,521 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2024-11-17 03:26:06,521 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 1057 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-17 03:26:06,522 INFO L140 encePairwiseOnDemand]: 63/74 looper letters, 43 selfloop transitions, 10 changer transitions 3/74 dead transitions. [2024-11-17 03:26:06,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 74 transitions, 340 flow [2024-11-17 03:26:06,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 03:26:06,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-17 03:26:06,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 467 transitions. [2024-11-17 03:26:06,523 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6310810810810811 [2024-11-17 03:26:06,523 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 186 flow. Second operand 10 states and 467 transitions. [2024-11-17 03:26:06,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 74 transitions, 340 flow [2024-11-17 03:26:06,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 74 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:26:06,525 INFO L231 Difference]: Finished difference. Result has 79 places, 56 transitions, 200 flow [2024-11-17 03:26:06,525 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-17 03:26:06,525 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 4 predicate places. [2024-11-17 03:26:06,525 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 56 transitions, 200 flow [2024-11-17 03:26:06,526 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-17 03:26:06,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:06,526 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-17 03:26:06,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 03:26:06,526 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-17 03:26:06,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:06,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1390270550, now seen corresponding path program 1 times [2024-11-17 03:26:06,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:06,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414262269] [2024-11-17 03:26:06,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:06,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:06,655 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-17 03:26:06,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:06,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414262269] [2024-11-17 03:26:06,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414262269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:06,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:06,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:26:06,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385844921] [2024-11-17 03:26:06,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:06,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:26:06,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:06,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:26:06,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:26:06,832 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 74 [2024-11-17 03:26:06,832 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-17 03:26:06,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:06,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 74 [2024-11-17 03:26:06,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:06,991 INFO L124 PetriNetUnfolderBase]: 73/258 cut-off events. [2024-11-17 03:26:06,991 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2024-11-17 03:26:06,991 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 966 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-17 03:26:06,992 INFO L140 encePairwiseOnDemand]: 67/74 looper letters, 47 selfloop transitions, 6 changer transitions 3/73 dead transitions. [2024-11-17 03:26:06,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 73 transitions, 346 flow [2024-11-17 03:26:06,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 03:26:06,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-17 03:26:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 299 transitions. [2024-11-17 03:26:06,993 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6734234234234234 [2024-11-17 03:26:06,994 INFO L175 Difference]: Start difference. First operand has 79 places, 56 transitions, 200 flow. Second operand 6 states and 299 transitions. [2024-11-17 03:26:06,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 73 transitions, 346 flow [2024-11-17 03:26:06,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 73 transitions, 326 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-11-17 03:26:06,995 INFO L231 Difference]: Finished difference. Result has 74 places, 55 transitions, 190 flow [2024-11-17 03:26:06,995 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-17 03:26:06,996 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, -1 predicate places. [2024-11-17 03:26:06,996 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 55 transitions, 190 flow [2024-11-17 03:26:06,996 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-17 03:26:06,996 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:06,997 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-17 03:26:06,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 03:26:06,997 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-17 03:26:06,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:06,997 INFO L85 PathProgramCache]: Analyzing trace with hash -148713566, now seen corresponding path program 1 times [2024-11-17 03:26:06,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:06,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331822365] [2024-11-17 03:26:06,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:06,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:07,760 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-17 03:26:07,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:07,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331822365] [2024-11-17 03:26:07,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331822365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:07,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:07,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-17 03:26:07,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469293547] [2024-11-17 03:26:07,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:07,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 03:26:07,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:07,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 03:26:07,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-17 03:26:08,670 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 74 [2024-11-17 03:26:08,671 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-17 03:26:08,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:08,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 74 [2024-11-17 03:26:08,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:09,047 INFO L124 PetriNetUnfolderBase]: 124/391 cut-off events. [2024-11-17 03:26:09,047 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-11-17 03:26:09,048 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 1770 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-17 03:26:09,049 INFO L140 encePairwiseOnDemand]: 61/74 looper letters, 59 selfloop transitions, 15 changer transitions 0/86 dead transitions. [2024-11-17 03:26:09,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 86 transitions, 408 flow [2024-11-17 03:26:09,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 03:26:09,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-17 03:26:09,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 469 transitions. [2024-11-17 03:26:09,050 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4875259875259875 [2024-11-17 03:26:09,051 INFO L175 Difference]: Start difference. First operand has 74 places, 55 transitions, 190 flow. Second operand 13 states and 469 transitions. [2024-11-17 03:26:09,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 86 transitions, 408 flow [2024-11-17 03:26:09,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 86 transitions, 388 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-17 03:26:09,052 INFO L231 Difference]: Finished difference. Result has 85 places, 62 transitions, 245 flow [2024-11-17 03:26:09,053 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-17 03:26:09,053 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2024-11-17 03:26:09,053 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 62 transitions, 245 flow [2024-11-17 03:26:09,053 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-17 03:26:09,053 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:09,053 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-17 03:26:09,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 03:26:09,054 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-17 03:26:09,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:09,054 INFO L85 PathProgramCache]: Analyzing trace with hash -148713567, now seen corresponding path program 1 times [2024-11-17 03:26:09,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:09,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949400480] [2024-11-17 03:26:09,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:09,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:09,836 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-17 03:26:09,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:09,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949400480] [2024-11-17 03:26:09,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949400480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:09,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:09,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-17 03:26:09,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863023662] [2024-11-17 03:26:09,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:09,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 03:26:09,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:09,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 03:26:09,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-17 03:26:10,647 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 74 [2024-11-17 03:26:10,648 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-17 03:26:10,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:10,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 74 [2024-11-17 03:26:10,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:11,037 INFO L124 PetriNetUnfolderBase]: 124/387 cut-off events. [2024-11-17 03:26:11,037 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2024-11-17 03:26:11,038 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 1729 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-17 03:26:11,039 INFO L140 encePairwiseOnDemand]: 60/74 looper letters, 55 selfloop transitions, 17 changer transitions 0/84 dead transitions. [2024-11-17 03:26:11,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 84 transitions, 433 flow [2024-11-17 03:26:11,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 03:26:11,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-17 03:26:11,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 531 transitions. [2024-11-17 03:26:11,043 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5519750519750519 [2024-11-17 03:26:11,043 INFO L175 Difference]: Start difference. First operand has 85 places, 62 transitions, 245 flow. Second operand 13 states and 531 transitions. [2024-11-17 03:26:11,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 84 transitions, 433 flow [2024-11-17 03:26:11,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 84 transitions, 420 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-17 03:26:11,045 INFO L231 Difference]: Finished difference. Result has 93 places, 63 transitions, 289 flow [2024-11-17 03:26:11,045 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-17 03:26:11,045 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 18 predicate places. [2024-11-17 03:26:11,045 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 63 transitions, 289 flow [2024-11-17 03:26:11,046 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-17 03:26:11,046 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:11,046 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-17 03:26:11,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 03:26:11,046 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-17 03:26:11,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:11,046 INFO L85 PathProgramCache]: Analyzing trace with hash 726130418, now seen corresponding path program 1 times [2024-11-17 03:26:11,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:11,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261715713] [2024-11-17 03:26:11,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:11,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:26:11,355 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-17 03:26:11,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 03:26:11,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261715713] [2024-11-17 03:26:11,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261715713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:26:11,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:26:11,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 03:26:11,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382370978] [2024-11-17 03:26:11,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:26:11,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 03:26:11,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 03:26:11,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 03:26:11,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-17 03:26:11,683 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 74 [2024-11-17 03:26:11,683 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-17 03:26:11,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:26:11,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 74 [2024-11-17 03:26:11,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:26:11,819 INFO L124 PetriNetUnfolderBase]: 100/321 cut-off events. [2024-11-17 03:26:11,820 INFO L125 PetriNetUnfolderBase]: For 232/234 co-relation queries the response was YES. [2024-11-17 03:26:11,820 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 1367 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-17 03:26:11,821 INFO L140 encePairwiseOnDemand]: 67/74 looper letters, 44 selfloop transitions, 6 changer transitions 0/70 dead transitions. [2024-11-17 03:26:11,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 70 transitions, 425 flow [2024-11-17 03:26:11,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:26:11,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:26:11,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 221 transitions. [2024-11-17 03:26:11,822 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5972972972972973 [2024-11-17 03:26:11,822 INFO L175 Difference]: Start difference. First operand has 93 places, 63 transitions, 289 flow. Second operand 5 states and 221 transitions. [2024-11-17 03:26:11,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 70 transitions, 425 flow [2024-11-17 03:26:11,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 70 transitions, 398 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-11-17 03:26:11,824 INFO L231 Difference]: Finished difference. Result has 86 places, 62 transitions, 277 flow [2024-11-17 03:26:11,824 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-17 03:26:11,825 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 11 predicate places. [2024-11-17 03:26:11,825 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 62 transitions, 277 flow [2024-11-17 03:26:11,825 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-17 03:26:11,825 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:26:11,825 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-17 03:26:11,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 03:26:11,826 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-17 03:26:11,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:26:11,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1035207026, now seen corresponding path program 1 times [2024-11-17 03:26:11,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 03:26:11,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767319768] [2024-11-17 03:26:11,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:26:11,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 03:26:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:26:11,861 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:26:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:26:11,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 03:26:11,998 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:26:12,000 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 50 remaining) [2024-11-17 03:26:12,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2024-11-17 03:26:12,002 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2024-11-17 03:26:12,003 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2024-11-17 03:26:12,004 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2024-11-17 03:26:12,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2024-11-17 03:26:12,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2024-11-17 03:26:12,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2024-11-17 03:26:12,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2024-11-17 03:26:12,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2024-11-17 03:26:12,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2024-11-17 03:26:12,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2024-11-17 03:26:12,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2024-11-17 03:26:12,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2024-11-17 03:26:12,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2024-11-17 03:26:12,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2024-11-17 03:26:12,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2024-11-17 03:26:12,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2024-11-17 03:26:12,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2024-11-17 03:26:12,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2024-11-17 03:26:12,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2024-11-17 03:26:12,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2024-11-17 03:26:12,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2024-11-17 03:26:12,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2024-11-17 03:26:12,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2024-11-17 03:26:12,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (24 of 50 remaining) [2024-11-17 03:26:12,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 50 remaining) [2024-11-17 03:26:12,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2024-11-17 03:26:12,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2024-11-17 03:26:12,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2024-11-17 03:26:12,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2024-11-17 03:26:12,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2024-11-17 03:26:12,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2024-11-17 03:26:12,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2024-11-17 03:26:12,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2024-11-17 03:26:12,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2024-11-17 03:26:12,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2024-11-17 03:26:12,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2024-11-17 03:26:12,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2024-11-17 03:26:12,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2024-11-17 03:26:12,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2024-11-17 03:26:12,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2024-11-17 03:26:12,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2024-11-17 03:26:12,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2024-11-17 03:26:12,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2024-11-17 03:26:12,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2024-11-17 03:26:12,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2024-11-17 03:26:12,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2024-11-17 03:26:12,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2024-11-17 03:26:12,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 50 remaining) [2024-11-17 03:26:12,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 03:26:12,015 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-17 03:26:12,057 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 03:26:12,057 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:26:12,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:26:12 BasicIcfg [2024-11-17 03:26:12,061 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:26:12,062 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:26:12,062 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:26:12,062 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:26:12,062 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:25:59" (3/4) ... [2024-11-17 03:26:12,063 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-17 03:26:12,097 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 03:26:12,097 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:26:12,098 INFO L158 Benchmark]: Toolchain (without parser) took 14257.62ms. Allocated memory was 213.9MB in the beginning and 465.6MB in the end (delta: 251.7MB). Free memory was 143.4MB in the beginning and 334.8MB in the end (delta: -191.4MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. [2024-11-17 03:26:12,098 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 113.2MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:26:12,098 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1006.14ms. Allocated memory is still 213.9MB. Free memory was 143.0MB in the beginning and 162.3MB in the end (delta: -19.3MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2024-11-17 03:26:12,098 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.99ms. Allocated memory is still 213.9MB. Free memory was 162.3MB in the beginning and 159.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 03:26:12,098 INFO L158 Benchmark]: Boogie Preprocessor took 69.97ms. Allocated memory is still 213.9MB. Free memory was 159.2MB in the beginning and 155.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 03:26:12,099 INFO L158 Benchmark]: IcfgBuilder took 737.30ms. Allocated memory is still 213.9MB. Free memory was 155.0MB in the beginning and 171.0MB in the end (delta: -16.1MB). Peak memory consumption was 101.4MB. Max. memory is 16.1GB. [2024-11-17 03:26:12,099 INFO L158 Benchmark]: TraceAbstraction took 12336.18ms. Allocated memory was 213.9MB in the beginning and 465.6MB in the end (delta: 251.7MB). Free memory was 170.0MB in the beginning and 340.0MB in the end (delta: -170.0MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB. [2024-11-17 03:26:12,099 INFO L158 Benchmark]: Witness Printer took 35.77ms. Allocated memory is still 465.6MB. Free memory was 340.0MB in the beginning and 334.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-17 03:26:12,100 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.10ms. Allocated memory is still 113.2MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1006.14ms. Allocated memory is still 213.9MB. Free memory was 143.0MB in the beginning and 162.3MB in the end (delta: -19.3MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.99ms. Allocated memory is still 213.9MB. Free memory was 162.3MB in the beginning and 159.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.97ms. Allocated memory is still 213.9MB. Free memory was 159.2MB in the beginning and 155.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 737.30ms. Allocated memory is still 213.9MB. Free memory was 155.0MB in the beginning and 171.0MB in the end (delta: -16.1MB). Peak memory consumption was 101.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12336.18ms. Allocated memory was 213.9MB in the beginning and 465.6MB in the end (delta: 251.7MB). Free memory was 170.0MB in the beginning and 340.0MB in the end (delta: -170.0MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB. * Witness Printer took 35.77ms. Allocated memory is still 465.6MB. Free memory was 340.0MB in the beginning and 334.8MB in the end (delta: 5.2MB). 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: [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1232-L1235] 0 struct cache { struct s *slots[10]; pthread_mutex_t mutex[10]; } c; [L1256] 0 int i = 0; VAL [c={1:0}, i=0] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=1] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=2] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=3] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=4] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=5] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=6] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=7] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=8] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=9] [L1256] COND TRUE 0 i < 10 [L1256] 0 i++ VAL [c={1:0}, i=10] [L1256] COND FALSE 0 !(i < 10) VAL [c={1:0}, i=10] [L1258] 0 int j = __VERIFIER_nondet_int(); [L1259] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1259] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1260] 0 struct s *p; [L1261] 0 pthread_t t1; [L1262] CALL, EXPR 0 new(1) [L1237] 0 struct s *p = malloc(sizeof(struct s)); [L1238] 0 p->datum = x VAL [c={1:0}] [L1239] 0 p->next = ((void *)0) [L1240] 0 return p; [L1262] RET, EXPR 0 new(1) [L1262] 0 c.slots[j] = new(1) [L1263] CALL, EXPR 0 new(2) [L1237] 0 struct s *p = malloc(sizeof(struct s)); [L1238] 0 p->datum = x VAL [c={1:0}] [L1239] 0 p->next = ((void *)0) [L1240] 0 return p; [L1263] RET, EXPR 0 new(2) [L1263] EXPR 0 c.slots[j] [L1263] CALL 0 list_add(new(2), c.slots[j]) [L1243] EXPR 0 list->next [L1243] 0 struct s *temp = list->next; [L1244] 0 list->next = node VAL [c={1:0}] [L1245] 0 node->next = temp [L1263] RET 0 list_add(new(2), c.slots[j]) [L1264] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [c={1:0}, j=7, t1=-1] [L1248] 1 int i = __VERIFIER_nondet_int(); [L1249] CALL 1 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 1 !(!cond) [L1249] RET 1 assume_abort_if_not(0 <= i && i < 10) [L1251] CALL, EXPR 1 new(3) [L1237] 1 struct s *p = malloc(sizeof(struct s)); [L1238] 1 p->datum = x VAL [\old(arg)={0:0}, arg={0:0}, c={1:0}, i=8] [L1239] 1 p->next = ((void *)0) [L1240] 1 return p; [L1251] RET, EXPR 1 new(3) [L1251] EXPR 1 c.slots[i] [L1251] CALL 1 list_add(new(3), c.slots[i]) [L1243] 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: 1255]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1264]: 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: 12.2s, OverallIterations: 19, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3074 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2252 mSDsluCounter, 1940 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1858 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8594 IncrementalHoareTripleChecker+Invalid, 8713 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 82 mSDtfsCounter, 8594 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 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.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 557 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 514 ConstructedInterpolants, 0 QuantifiedInterpolants, 3119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 396 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-17 03:26:12,124 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)