./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr-deref.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c488feb98493d291286969cd9fdbd15fc14c729caece3fe94bd3c70430190936 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:41:19,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:41:19,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:41:19,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:41:19,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:41:20,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:41:20,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:41:20,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:41:20,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:41:20,007 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:41:20,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:41:20,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:41:20,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:41:20,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:41:20,009 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:41:20,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:41:20,010 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:41:20,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:41:20,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:41:20,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:41:20,014 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:41:20,015 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:41:20,015 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:41:20,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:41:20,015 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:41:20,016 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:41:20,016 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:41:20,016 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:41:20,016 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:41:20,016 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:41:20,016 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:41:20,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:41:20,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:41:20,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:41:20,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:41:20,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:41:20,018 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:41:20,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:41:20,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:41:20,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:41:20,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:41:20,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:41:20,019 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c488feb98493d291286969cd9fdbd15fc14c729caece3fe94bd3c70430190936 [2024-10-14 19:41:20,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:41:20,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:41:20,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:41:20,279 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:41:20,280 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:41:20,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr-deref.i [2024-10-14 19:41:21,582 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:41:21,825 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:41:21,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr-deref.i [2024-10-14 19:41:21,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afde920ea/7a84ecfe009c4d548eaaa546e05262d1/FLAG62bb744d7 [2024-10-14 19:41:21,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afde920ea/7a84ecfe009c4d548eaaa546e05262d1 [2024-10-14 19:41:21,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:41:21,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:41:21,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:41:21,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:41:21,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:41:21,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:41:21" (1/1) ... [2024-10-14 19:41:21,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bceb31a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:21, skipping insertion in model container [2024-10-14 19:41:21,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:41:21" (1/1) ... [2024-10-14 19:41:21,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:41:22,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:41:22,371 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:41:22,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:41:22,493 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:41:22,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:22 WrapperNode [2024-10-14 19:41:22,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:41:22,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:41:22,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:41:22,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:41:22,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:22" (1/1) ... [2024-10-14 19:41:22,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:22" (1/1) ... [2024-10-14 19:41:22,557 INFO L138 Inliner]: procedures = 370, calls = 28, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 121 [2024-10-14 19:41:22,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:41:22,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:41:22,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:41:22,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:41:22,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:22" (1/1) ... [2024-10-14 19:41:22,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:22" (1/1) ... [2024-10-14 19:41:22,576 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:22" (1/1) ... [2024-10-14 19:41:22,601 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [1, 5, 14]. 70 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 13 writes are split as follows [1, 2, 10]. [2024-10-14 19:41:22,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:22" (1/1) ... [2024-10-14 19:41:22,602 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:22" (1/1) ... [2024-10-14 19:41:22,612 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:22" (1/1) ... [2024-10-14 19:41:22,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:22" (1/1) ... [2024-10-14 19:41:22,623 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:22" (1/1) ... [2024-10-14 19:41:22,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:22" (1/1) ... [2024-10-14 19:41:22,636 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:41:22,637 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:41:22,637 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:41:22,637 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:41:22,638 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:22" (1/1) ... [2024-10-14 19:41:22,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:41:22,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:41:22,672 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 19:41:22,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 19:41:22,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 19:41:22,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 19:41:22,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 19:41:22,719 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-14 19:41:22,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 19:41:22,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 19:41:22,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 19:41:22,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 19:41:22,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 19:41:22,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 19:41:22,719 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-14 19:41:22,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 19:41:22,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:41:22,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 19:41:22,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 19:41:22,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 19:41:22,720 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-14 19:41:22,720 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-14 19:41:22,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:41:22,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:41:22,722 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 19:41:22,850 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:41:22,852 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:41:23,149 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 19:41:23,150 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:41:23,318 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:41:23,318 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 19:41:23,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:41:23 BoogieIcfgContainer [2024-10-14 19:41:23,332 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:41:23,336 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:41:23,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:41:23,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:41:23,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:41:21" (1/3) ... [2024-10-14 19:41:23,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1129b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:41:23, skipping insertion in model container [2024-10-14 19:41:23,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:22" (2/3) ... [2024-10-14 19:41:23,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1129b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:41:23, skipping insertion in model container [2024-10-14 19:41:23,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:41:23" (3/3) ... [2024-10-14 19:41:23,340 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_11-arraylist_nr-deref.i [2024-10-14 19:41:23,360 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:41:23,360 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-10-14 19:41:23,360 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 19:41:23,397 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-14 19:41:23,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 71 transitions, 146 flow [2024-10-14 19:41:23,455 INFO L124 PetriNetUnfolderBase]: 1/70 cut-off events. [2024-10-14 19:41:23,455 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:41:23,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 70 events. 1/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 163 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2024-10-14 19:41:23,461 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 71 transitions, 146 flow [2024-10-14 19:41:23,465 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 70 transitions, 143 flow [2024-10-14 19:41:23,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:41:23,486 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;@3806c99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:41:23,487 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-10-14 19:41:23,489 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 19:41:23,490 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-10-14 19:41:23,490 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:41:23,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:23,491 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-14 19:41:23,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 19:41:23,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:23,495 INFO L85 PathProgramCache]: Analyzing trace with hash 383968, now seen corresponding path program 1 times [2024-10-14 19:41:23,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:23,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366058567] [2024-10-14 19:41:23,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:23,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:41:23,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:23,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366058567] [2024-10-14 19:41:23,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366058567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:23,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:23,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:41:23,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927314870] [2024-10-14 19:41:23,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:23,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:41:23,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:23,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:41:23,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:41:23,751 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2024-10-14 19:41:23,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:23,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:23,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2024-10-14 19:41:23,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:23,886 INFO L124 PetriNetUnfolderBase]: 64/266 cut-off events. [2024-10-14 19:41:23,887 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:41:23,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 266 events. 64/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1213 event pairs, 63 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 376. Up to 153 conditions per place. [2024-10-14 19:41:23,893 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 25 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-10-14 19:41:23,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 71 transitions, 199 flow [2024-10-14 19:41:23,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:41:23,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:41:23,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2024-10-14 19:41:23,905 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7652582159624414 [2024-10-14 19:41:23,907 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 143 flow. Second operand 3 states and 163 transitions. [2024-10-14 19:41:23,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 71 transitions, 199 flow [2024-10-14 19:41:23,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 71 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 19:41:23,915 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 154 flow [2024-10-14 19:41:23,917 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2024-10-14 19:41:23,921 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 2 predicate places. [2024-10-14 19:41:23,921 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 154 flow [2024-10-14 19:41:23,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:23,924 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:23,924 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-14 19:41:23,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 19:41:23,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 19:41:23,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:23,925 INFO L85 PathProgramCache]: Analyzing trace with hash 11900592, now seen corresponding path program 1 times [2024-10-14 19:41:23,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:23,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587285736] [2024-10-14 19:41:23,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:23,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:24,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:41:24,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:24,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587285736] [2024-10-14 19:41:24,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587285736] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 19:41:24,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711007928] [2024-10-14 19:41:24,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:24,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 19:41:24,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:41:24,028 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-10-14 19:41:24,030 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-10-14 19:41:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:24,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:41:24,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:41:24,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:41:24,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:41:24,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:41:24,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711007928] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:41:24,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 19:41:24,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-14 19:41:24,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459786698] [2024-10-14 19:41:24,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 19:41:24,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 19:41:24,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:24,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 19:41:24,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-14 19:41:24,185 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2024-10-14 19:41:24,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:24,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:24,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2024-10-14 19:41:24,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:24,314 INFO L124 PetriNetUnfolderBase]: 64/269 cut-off events. [2024-10-14 19:41:24,314 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 19:41:24,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 269 events. 64/269 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1213 event pairs, 63 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 428. Up to 153 conditions per place. [2024-10-14 19:41:24,318 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 25 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2024-10-14 19:41:24,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 226 flow [2024-10-14 19:41:24,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:41:24,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:41:24,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 303 transitions. [2024-10-14 19:41:24,323 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7112676056338029 [2024-10-14 19:41:24,324 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 154 flow. Second operand 6 states and 303 transitions. [2024-10-14 19:41:24,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 226 flow [2024-10-14 19:41:24,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 74 transitions, 222 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-14 19:41:24,327 INFO L231 Difference]: Finished difference. Result has 82 places, 74 transitions, 186 flow [2024-10-14 19:41:24,327 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=82, PETRI_TRANSITIONS=74} [2024-10-14 19:41:24,328 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 9 predicate places. [2024-10-14 19:41:24,328 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 186 flow [2024-10-14 19:41:24,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:24,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:24,329 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2024-10-14 19:41:24,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 19:41:24,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 19:41:24,531 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 19:41:24,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:24,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1954148384, now seen corresponding path program 2 times [2024-10-14 19:41:24,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:24,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708392549] [2024-10-14 19:41:24,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:24,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:24,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 19:41:24,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:24,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708392549] [2024-10-14 19:41:24,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708392549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:24,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:24,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:41:24,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818891964] [2024-10-14 19:41:24,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:24,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:41:24,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:24,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:41:24,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:41:24,713 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 71 [2024-10-14 19:41:24,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 74 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:24,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:24,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 71 [2024-10-14 19:41:24,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:24,818 INFO L124 PetriNetUnfolderBase]: 64/265 cut-off events. [2024-10-14 19:41:24,818 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-14 19:41:24,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 265 events. 64/265 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1196 event pairs, 63 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 417. Up to 155 conditions per place. [2024-10-14 19:41:24,823 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 28 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2024-10-14 19:41:24,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 70 transitions, 242 flow [2024-10-14 19:41:24,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:41:24,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:41:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2024-10-14 19:41:24,826 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6995305164319249 [2024-10-14 19:41:24,826 INFO L175 Difference]: Start difference. First operand has 82 places, 74 transitions, 186 flow. Second operand 3 states and 149 transitions. [2024-10-14 19:41:24,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 70 transitions, 242 flow [2024-10-14 19:41:24,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 70 transitions, 228 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-10-14 19:41:24,829 INFO L231 Difference]: Finished difference. Result has 79 places, 70 transitions, 172 flow [2024-10-14 19:41:24,830 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=79, PETRI_TRANSITIONS=70} [2024-10-14 19:41:24,830 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 6 predicate places. [2024-10-14 19:41:24,831 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 70 transitions, 172 flow [2024-10-14 19:41:24,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:24,832 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:24,832 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2024-10-14 19:41:24,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 19:41:24,832 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 19:41:24,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:24,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1954148383, now seen corresponding path program 1 times [2024-10-14 19:41:24,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:24,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001523702] [2024-10-14 19:41:24,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:24,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:41:24,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:24,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001523702] [2024-10-14 19:41:24,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001523702] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 19:41:24,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516031173] [2024-10-14 19:41:24,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:24,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 19:41:24,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:41:24,925 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-10-14 19:41:24,929 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-10-14 19:41:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:24,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:41:24,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:41:25,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:41:25,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:41:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:41:25,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516031173] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:41:25,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 19:41:25,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-14 19:41:25,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991322929] [2024-10-14 19:41:25,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 19:41:25,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 19:41:25,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:25,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 19:41:25,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-14 19:41:25,062 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2024-10-14 19:41:25,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 70 transitions, 172 flow. Second operand has 13 states, 13 states have (on average 46.07692307692308) internal successors, (599), 13 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:25,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:25,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2024-10-14 19:41:25,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:25,189 INFO L124 PetriNetUnfolderBase]: 64/271 cut-off events. [2024-10-14 19:41:25,189 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-10-14 19:41:25,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 271 events. 64/271 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1199 event pairs, 63 based on Foata normal form. 6/219 useless extension candidates. Maximal degree in co-relation 419. Up to 153 conditions per place. [2024-10-14 19:41:25,191 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 25 selfloop transitions, 11 changer transitions 0/76 dead transitions. [2024-10-14 19:41:25,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 76 transitions, 280 flow [2024-10-14 19:41:25,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 19:41:25,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-14 19:41:25,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 582 transitions. [2024-10-14 19:41:25,193 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6830985915492958 [2024-10-14 19:41:25,193 INFO L175 Difference]: Start difference. First operand has 79 places, 70 transitions, 172 flow. Second operand 12 states and 582 transitions. [2024-10-14 19:41:25,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 76 transitions, 280 flow [2024-10-14 19:41:25,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 76 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:41:25,195 INFO L231 Difference]: Finished difference. Result has 94 places, 76 transitions, 248 flow [2024-10-14 19:41:25,195 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=248, PETRI_PLACES=94, PETRI_TRANSITIONS=76} [2024-10-14 19:41:25,196 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 21 predicate places. [2024-10-14 19:41:25,196 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 76 transitions, 248 flow [2024-10-14 19:41:25,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.07692307692308) internal successors, (599), 13 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:25,196 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:25,196 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2024-10-14 19:41:25,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 19:41:25,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-14 19:41:25,401 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 19:41:25,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:25,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1909038561, now seen corresponding path program 2 times [2024-10-14 19:41:25,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:25,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928663203] [2024-10-14 19:41:25,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:25,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:25,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:25,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928663203] [2024-10-14 19:41:25,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928663203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:25,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:25,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:41:25,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932005380] [2024-10-14 19:41:25,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:25,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:41:25,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:25,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:41:25,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:41:25,529 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 71 [2024-10-14 19:41:25,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 76 transitions, 248 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-10-14 19:41:25,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:25,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 71 [2024-10-14 19:41:25,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:25,607 INFO L124 PetriNetUnfolderBase]: 64/267 cut-off events. [2024-10-14 19:41:25,607 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-10-14 19:41:25,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 267 events. 64/267 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1178 event pairs, 63 based on Foata normal form. 2/213 useless extension candidates. Maximal degree in co-relation 417. Up to 161 conditions per place. [2024-10-14 19:41:25,609 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 32 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2024-10-14 19:41:25,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 72 transitions, 312 flow [2024-10-14 19:41:25,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:41:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:41:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2024-10-14 19:41:25,610 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7183098591549296 [2024-10-14 19:41:25,610 INFO L175 Difference]: Start difference. First operand has 94 places, 76 transitions, 248 flow. Second operand 3 states and 153 transitions. [2024-10-14 19:41:25,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 72 transitions, 312 flow [2024-10-14 19:41:25,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 72 transitions, 264 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-10-14 19:41:25,613 INFO L231 Difference]: Finished difference. Result has 87 places, 72 transitions, 200 flow [2024-10-14 19:41:25,613 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=85, 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=200, PETRI_PLACES=87, PETRI_TRANSITIONS=72} [2024-10-14 19:41:25,613 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 14 predicate places. [2024-10-14 19:41:25,614 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 72 transitions, 200 flow [2024-10-14 19:41:25,614 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-10-14 19:41:25,614 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:25,614 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2024-10-14 19:41:25,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 19:41:25,614 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 19:41:25,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:25,615 INFO L85 PathProgramCache]: Analyzing trace with hash 635031585, now seen corresponding path program 1 times [2024-10-14 19:41:25,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:25,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964155634] [2024-10-14 19:41:25,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:25,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:25,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:25,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964155634] [2024-10-14 19:41:25,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964155634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:25,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:25,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:41:25,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392655885] [2024-10-14 19:41:25,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:25,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:41:25,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:25,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:41:25,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:41:25,883 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2024-10-14 19:41:25,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 72 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:25,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:25,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2024-10-14 19:41:25,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:25,947 INFO L124 PetriNetUnfolderBase]: 73/289 cut-off events. [2024-10-14 19:41:25,947 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-10-14 19:41:25,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 289 events. 73/289 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1306 event pairs, 72 based on Foata normal form. 1/238 useless extension candidates. Maximal degree in co-relation 464. Up to 183 conditions per place. [2024-10-14 19:41:25,949 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 38 selfloop transitions, 1 changer transitions 0/68 dead transitions. [2024-10-14 19:41:25,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 68 transitions, 270 flow [2024-10-14 19:41:25,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:41:25,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:41:25,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2024-10-14 19:41:25,950 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6901408450704225 [2024-10-14 19:41:25,950 INFO L175 Difference]: Start difference. First operand has 87 places, 72 transitions, 200 flow. Second operand 3 states and 147 transitions. [2024-10-14 19:41:25,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 68 transitions, 270 flow [2024-10-14 19:41:25,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 68 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:41:25,962 INFO L231 Difference]: Finished difference. Result has 83 places, 68 transitions, 186 flow [2024-10-14 19:41:25,963 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=83, PETRI_TRANSITIONS=68} [2024-10-14 19:41:25,963 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2024-10-14 19:41:25,963 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 68 transitions, 186 flow [2024-10-14 19:41:25,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:25,963 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:25,963 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2024-10-14 19:41:25,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 19:41:25,964 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 19:41:25,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:25,964 INFO L85 PathProgramCache]: Analyzing trace with hash 635031586, now seen corresponding path program 1 times [2024-10-14 19:41:25,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:25,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499100342] [2024-10-14 19:41:25,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:25,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:26,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:26,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499100342] [2024-10-14 19:41:26,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499100342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:26,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:26,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:41:26,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690982843] [2024-10-14 19:41:26,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:26,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:41:26,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:26,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:41:26,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:41:26,291 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 71 [2024-10-14 19:41:26,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 68 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:26,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:26,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 71 [2024-10-14 19:41:26,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:26,405 INFO L124 PetriNetUnfolderBase]: 73/285 cut-off events. [2024-10-14 19:41:26,405 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-10-14 19:41:26,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 285 events. 73/285 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1291 event pairs, 63 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 488. Up to 148 conditions per place. [2024-10-14 19:41:26,407 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 37 selfloop transitions, 6 changer transitions 3/74 dead transitions. [2024-10-14 19:41:26,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 74 transitions, 290 flow [2024-10-14 19:41:26,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:41:26,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:41:26,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2024-10-14 19:41:26,409 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6309859154929578 [2024-10-14 19:41:26,409 INFO L175 Difference]: Start difference. First operand has 83 places, 68 transitions, 186 flow. Second operand 5 states and 224 transitions. [2024-10-14 19:41:26,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 74 transitions, 290 flow [2024-10-14 19:41:26,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 74 transitions, 289 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 19:41:26,412 INFO L231 Difference]: Finished difference. Result has 83 places, 65 transitions, 191 flow [2024-10-14 19:41:26,412 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=83, PETRI_TRANSITIONS=65} [2024-10-14 19:41:26,413 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2024-10-14 19:41:26,414 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 191 flow [2024-10-14 19:41:26,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:26,414 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:26,414 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:41:26,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 19:41:26,414 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 19:41:26,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:26,415 INFO L85 PathProgramCache]: Analyzing trace with hash 117733888, now seen corresponding path program 1 times [2024-10-14 19:41:26,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:26,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296462436] [2024-10-14 19:41:26,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:26,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:26,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:26,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296462436] [2024-10-14 19:41:26,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296462436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:26,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:26,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:41:26,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819369464] [2024-10-14 19:41:26,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:26,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 19:41:26,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:26,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 19:41:26,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 19:41:26,857 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 71 [2024-10-14 19:41:26,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 191 flow. Second operand has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:26,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:26,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 71 [2024-10-14 19:41:26,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:26,987 INFO L124 PetriNetUnfolderBase]: 64/253 cut-off events. [2024-10-14 19:41:26,987 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-10-14 19:41:26,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 253 events. 64/253 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1094 event pairs, 54 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 454. Up to 126 conditions per place. [2024-10-14 19:41:26,989 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 38 selfloop transitions, 7 changer transitions 3/72 dead transitions. [2024-10-14 19:41:26,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 72 transitions, 301 flow [2024-10-14 19:41:26,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 19:41:26,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-14 19:41:26,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 292 transitions. [2024-10-14 19:41:26,990 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5875251509054326 [2024-10-14 19:41:26,990 INFO L175 Difference]: Start difference. First operand has 83 places, 65 transitions, 191 flow. Second operand 7 states and 292 transitions. [2024-10-14 19:41:26,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 72 transitions, 301 flow [2024-10-14 19:41:26,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 72 transitions, 289 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-14 19:41:26,992 INFO L231 Difference]: Finished difference. Result has 83 places, 63 transitions, 189 flow [2024-10-14 19:41:26,992 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=175, 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=189, PETRI_PLACES=83, PETRI_TRANSITIONS=63} [2024-10-14 19:41:26,992 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2024-10-14 19:41:26,992 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 63 transitions, 189 flow [2024-10-14 19:41:26,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.42857142857143) internal successors, (262), 7 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:26,993 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:26,993 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:41:26,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 19:41:26,993 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 19:41:26,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:26,993 INFO L85 PathProgramCache]: Analyzing trace with hash 117733889, now seen corresponding path program 1 times [2024-10-14 19:41:26,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:26,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838567444] [2024-10-14 19:41:26,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:26,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:27,347 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:27,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:27,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838567444] [2024-10-14 19:41:27,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838567444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:27,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:27,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:41:27,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305685364] [2024-10-14 19:41:27,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:27,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 19:41:27,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:27,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 19:41:27,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 19:41:27,628 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 71 [2024-10-14 19:41:27,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 63 transitions, 189 flow. Second operand has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:27,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:27,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 71 [2024-10-14 19:41:27,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:27,763 INFO L124 PetriNetUnfolderBase]: 64/251 cut-off events. [2024-10-14 19:41:27,763 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-10-14 19:41:27,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 251 events. 64/251 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1090 event pairs, 54 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 453. Up to 126 conditions per place. [2024-10-14 19:41:27,764 INFO L140 encePairwiseOnDemand]: 62/71 looper letters, 37 selfloop transitions, 7 changer transitions 3/70 dead transitions. [2024-10-14 19:41:27,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 70 transitions, 297 flow [2024-10-14 19:41:27,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 19:41:27,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-14 19:41:27,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 270 transitions. [2024-10-14 19:41:27,765 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5432595573440644 [2024-10-14 19:41:27,766 INFO L175 Difference]: Start difference. First operand has 83 places, 63 transitions, 189 flow. Second operand 7 states and 270 transitions. [2024-10-14 19:41:27,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 70 transitions, 297 flow [2024-10-14 19:41:27,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 70 transitions, 283 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-14 19:41:27,767 INFO L231 Difference]: Finished difference. Result has 81 places, 61 transitions, 185 flow [2024-10-14 19:41:27,767 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=185, PETRI_PLACES=81, PETRI_TRANSITIONS=61} [2024-10-14 19:41:27,768 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 8 predicate places. [2024-10-14 19:41:27,768 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 61 transitions, 185 flow [2024-10-14 19:41:27,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:27,768 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:27,769 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:41:27,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 19:41:27,770 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 19:41:27,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:27,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1473131070, now seen corresponding path program 1 times [2024-10-14 19:41:27,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:27,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389665820] [2024-10-14 19:41:27,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:27,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:27,992 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:27,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:27,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389665820] [2024-10-14 19:41:27,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389665820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:27,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:27,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:41:27,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332173857] [2024-10-14 19:41:27,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:27,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:41:27,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:27,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:41:27,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:41:28,101 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 71 [2024-10-14 19:41:28,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 61 transitions, 185 flow. Second operand has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:28,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:28,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 71 [2024-10-14 19:41:28,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:28,219 INFO L124 PetriNetUnfolderBase]: 64/250 cut-off events. [2024-10-14 19:41:28,220 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2024-10-14 19:41:28,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 250 events. 64/250 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1094 event pairs, 63 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 450. Up to 158 conditions per place. [2024-10-14 19:41:28,221 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 30 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2024-10-14 19:41:28,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 60 transitions, 255 flow [2024-10-14 19:41:28,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:41:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:41:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 247 transitions. [2024-10-14 19:41:28,223 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6957746478873239 [2024-10-14 19:41:28,223 INFO L175 Difference]: Start difference. First operand has 81 places, 61 transitions, 185 flow. Second operand 5 states and 247 transitions. [2024-10-14 19:41:28,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 60 transitions, 255 flow [2024-10-14 19:41:28,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 60 transitions, 241 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-14 19:41:28,224 INFO L231 Difference]: Finished difference. Result has 78 places, 60 transitions, 181 flow [2024-10-14 19:41:28,225 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=78, PETRI_TRANSITIONS=60} [2024-10-14 19:41:28,225 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2024-10-14 19:41:28,225 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 60 transitions, 181 flow [2024-10-14 19:41:28,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:28,225 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:28,226 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:41:28,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 19:41:28,226 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 19:41:28,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:28,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1473131069, now seen corresponding path program 1 times [2024-10-14 19:41:28,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:28,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072228358] [2024-10-14 19:41:28,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:28,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:28,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:28,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072228358] [2024-10-14 19:41:28,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072228358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:28,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:28,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:41:28,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168756138] [2024-10-14 19:41:28,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:28,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:41:28,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:28,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:41:28,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:41:28,437 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2024-10-14 19:41:28,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 60 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:28,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:28,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2024-10-14 19:41:28,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:28,532 INFO L124 PetriNetUnfolderBase]: 64/249 cut-off events. [2024-10-14 19:41:28,532 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-10-14 19:41:28,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 249 events. 64/249 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1096 event pairs, 63 based on Foata normal form. 1/208 useless extension candidates. Maximal degree in co-relation 441. Up to 158 conditions per place. [2024-10-14 19:41:28,535 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 32 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2024-10-14 19:41:28,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 59 transitions, 255 flow [2024-10-14 19:41:28,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:41:28,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 19:41:28,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2024-10-14 19:41:28,537 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6169014084507042 [2024-10-14 19:41:28,537 INFO L175 Difference]: Start difference. First operand has 78 places, 60 transitions, 181 flow. Second operand 5 states and 219 transitions. [2024-10-14 19:41:28,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 59 transitions, 255 flow [2024-10-14 19:41:28,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 59 transitions, 243 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-14 19:41:28,538 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 179 flow [2024-10-14 19:41:28,539 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2024-10-14 19:41:28,539 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 4 predicate places. [2024-10-14 19:41:28,539 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 179 flow [2024-10-14 19:41:28,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:28,540 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:28,540 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:41:28,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 19:41:28,540 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 19:41:28,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:28,541 INFO L85 PathProgramCache]: Analyzing trace with hash 793358548, now seen corresponding path program 1 times [2024-10-14 19:41:28,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:28,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525023796] [2024-10-14 19:41:28,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:28,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:28,665 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:28,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:28,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525023796] [2024-10-14 19:41:28,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525023796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:28,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:28,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:41:28,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440135586] [2024-10-14 19:41:28,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:28,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:41:28,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:28,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:41:28,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:41:28,706 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 71 [2024-10-14 19:41:28,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 59 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:28,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:28,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 71 [2024-10-14 19:41:28,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:28,784 INFO L124 PetriNetUnfolderBase]: 71/259 cut-off events. [2024-10-14 19:41:28,785 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-10-14 19:41:28,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 259 events. 71/259 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1124 event pairs, 56 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 464. Up to 148 conditions per place. [2024-10-14 19:41:28,786 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 42 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-10-14 19:41:28,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 64 transitions, 277 flow [2024-10-14 19:41:28,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:41:28,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:41:28,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2024-10-14 19:41:28,787 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7605633802816901 [2024-10-14 19:41:28,787 INFO L175 Difference]: Start difference. First operand has 77 places, 59 transitions, 179 flow. Second operand 3 states and 162 transitions. [2024-10-14 19:41:28,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 64 transitions, 277 flow [2024-10-14 19:41:28,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 64 transitions, 265 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-14 19:41:28,789 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 167 flow [2024-10-14 19:41:28,789 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=163, 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=167, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2024-10-14 19:41:28,790 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2024-10-14 19:41:28,791 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 167 flow [2024-10-14 19:41:28,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:28,791 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:28,791 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:41:28,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 19:41:28,792 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 19:41:28,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:28,792 INFO L85 PathProgramCache]: Analyzing trace with hash 793358549, now seen corresponding path program 1 times [2024-10-14 19:41:28,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:28,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538361035] [2024-10-14 19:41:28,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:28,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:28,899 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:28,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:28,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538361035] [2024-10-14 19:41:28,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538361035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:28,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:28,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:41:28,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572840186] [2024-10-14 19:41:28,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:28,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:41:28,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:28,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:41:28,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:41:28,936 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 71 [2024-10-14 19:41:28,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:28,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:28,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 71 [2024-10-14 19:41:28,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:28,999 INFO L124 PetriNetUnfolderBase]: 64/236 cut-off events. [2024-10-14 19:41:28,999 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-10-14 19:41:28,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 236 events. 64/236 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 970 event pairs, 56 based on Foata normal form. 16/223 useless extension candidates. Maximal degree in co-relation 436. Up to 148 conditions per place. [2024-10-14 19:41:29,000 INFO L140 encePairwiseOnDemand]: 67/71 looper letters, 41 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2024-10-14 19:41:29,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 62 transitions, 263 flow [2024-10-14 19:41:29,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:41:29,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 19:41:29,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2024-10-14 19:41:29,001 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7699530516431925 [2024-10-14 19:41:29,001 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 167 flow. Second operand 3 states and 164 transitions. [2024-10-14 19:41:29,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 62 transitions, 263 flow [2024-10-14 19:41:29,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 62 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:41:29,003 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 163 flow [2024-10-14 19:41:29,003 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2024-10-14 19:41:29,003 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2024-10-14 19:41:29,004 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 163 flow [2024-10-14 19:41:29,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:29,004 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:29,004 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:41:29,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 19:41:29,004 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 19:41:29,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:29,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1207571574, now seen corresponding path program 1 times [2024-10-14 19:41:29,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:29,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730288900] [2024-10-14 19:41:29,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:29,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:29,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:29,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730288900] [2024-10-14 19:41:29,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730288900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:29,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:29,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 19:41:29,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937453920] [2024-10-14 19:41:29,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:29,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 19:41:29,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:29,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 19:41:29,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 19:41:29,611 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 71 [2024-10-14 19:41:29,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 163 flow. Second operand has 9 states, 9 states have (on average 41.666666666666664) internal successors, (375), 9 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:29,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:29,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 71 [2024-10-14 19:41:29,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:29,794 INFO L124 PetriNetUnfolderBase]: 85/291 cut-off events. [2024-10-14 19:41:29,795 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-10-14 19:41:29,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 291 events. 85/291 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1292 event pairs, 60 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 541. Up to 152 conditions per place. [2024-10-14 19:41:29,796 INFO L140 encePairwiseOnDemand]: 58/71 looper letters, 43 selfloop transitions, 12 changer transitions 3/74 dead transitions. [2024-10-14 19:41:29,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 325 flow [2024-10-14 19:41:29,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 19:41:29,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-14 19:41:29,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 449 transitions. [2024-10-14 19:41:29,798 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6323943661971831 [2024-10-14 19:41:29,798 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 163 flow. Second operand 10 states and 449 transitions. [2024-10-14 19:41:29,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 325 flow [2024-10-14 19:41:29,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 74 transitions, 313 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 19:41:29,800 INFO L231 Difference]: Finished difference. Result has 79 places, 57 transitions, 196 flow [2024-10-14 19:41:29,800 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=159, 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=10, PETRI_FLOW=196, PETRI_PLACES=79, PETRI_TRANSITIONS=57} [2024-10-14 19:41:29,800 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 6 predicate places. [2024-10-14 19:41:29,800 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 57 transitions, 196 flow [2024-10-14 19:41:29,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 41.666666666666664) internal successors, (375), 9 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:29,801 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:29,801 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:41:29,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 19:41:29,801 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 19:41:29,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:29,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1207571575, now seen corresponding path program 1 times [2024-10-14 19:41:29,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:29,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893673880] [2024-10-14 19:41:29,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:29,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:29,905 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:29,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:29,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893673880] [2024-10-14 19:41:29,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893673880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:29,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:29,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:41:29,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35027535] [2024-10-14 19:41:29,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:29,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:41:29,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:29,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:41:29,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:41:30,015 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 71 [2024-10-14 19:41:30,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 57 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 42.5) internal successors, (255), 6 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:30,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:30,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 71 [2024-10-14 19:41:30,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:30,136 INFO L124 PetriNetUnfolderBase]: 79/269 cut-off events. [2024-10-14 19:41:30,136 INFO L125 PetriNetUnfolderBase]: For 98/104 co-relation queries the response was YES. [2024-10-14 19:41:30,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 269 events. 79/269 cut-off events. For 98/104 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1132 event pairs, 54 based on Foata normal form. 17/255 useless extension candidates. Maximal degree in co-relation 551. Up to 132 conditions per place. [2024-10-14 19:41:30,137 INFO L140 encePairwiseOnDemand]: 64/71 looper letters, 47 selfloop transitions, 7 changer transitions 3/73 dead transitions. [2024-10-14 19:41:30,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 73 transitions, 344 flow [2024-10-14 19:41:30,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:41:30,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 19:41:30,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 287 transitions. [2024-10-14 19:41:30,138 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6737089201877934 [2024-10-14 19:41:30,138 INFO L175 Difference]: Start difference. First operand has 79 places, 57 transitions, 196 flow. Second operand 6 states and 287 transitions. [2024-10-14 19:41:30,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 73 transitions, 344 flow [2024-10-14 19:41:30,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 73 transitions, 323 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-14 19:41:30,140 INFO L231 Difference]: Finished difference. Result has 75 places, 56 transitions, 187 flow [2024-10-14 19:41:30,140 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=75, PETRI_TRANSITIONS=56} [2024-10-14 19:41:30,140 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 2 predicate places. [2024-10-14 19:41:30,140 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 56 transitions, 187 flow [2024-10-14 19:41:30,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.5) internal successors, (255), 6 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:30,140 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:30,140 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:41:30,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 19:41:30,140 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 19:41:30,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:30,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1219987277, now seen corresponding path program 1 times [2024-10-14 19:41:30,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:30,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647340590] [2024-10-14 19:41:30,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:30,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:30,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:30,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647340590] [2024-10-14 19:41:30,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647340590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:30,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:30,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 19:41:30,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063867018] [2024-10-14 19:41:30,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:30,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 19:41:30,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:30,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 19:41:30,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-14 19:41:31,602 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 71 [2024-10-14 19:41:31,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 56 transitions, 187 flow. Second operand has 13 states, 13 states have (on average 34.38461538461539) internal successors, (447), 13 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:31,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:31,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 71 [2024-10-14 19:41:31,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:31,951 INFO L124 PetriNetUnfolderBase]: 111/351 cut-off events. [2024-10-14 19:41:31,951 INFO L125 PetriNetUnfolderBase]: For 155/162 co-relation queries the response was YES. [2024-10-14 19:41:31,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 351 events. 111/351 cut-off events. For 155/162 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1620 event pairs, 20 based on Foata normal form. 0/312 useless extension candidates. Maximal degree in co-relation 729. Up to 138 conditions per place. [2024-10-14 19:41:31,953 INFO L140 encePairwiseOnDemand]: 58/71 looper letters, 57 selfloop transitions, 16 changer transitions 0/84 dead transitions. [2024-10-14 19:41:31,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 84 transitions, 407 flow [2024-10-14 19:41:31,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 19:41:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-14 19:41:31,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 459 transitions. [2024-10-14 19:41:31,955 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5387323943661971 [2024-10-14 19:41:31,955 INFO L175 Difference]: Start difference. First operand has 75 places, 56 transitions, 187 flow. Second operand 12 states and 459 transitions. [2024-10-14 19:41:31,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 84 transitions, 407 flow [2024-10-14 19:41:31,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 84 transitions, 385 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 19:41:31,957 INFO L231 Difference]: Finished difference. Result has 86 places, 64 transitions, 261 flow [2024-10-14 19:41:31,957 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=261, PETRI_PLACES=86, PETRI_TRANSITIONS=64} [2024-10-14 19:41:31,957 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 13 predicate places. [2024-10-14 19:41:31,957 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 64 transitions, 261 flow [2024-10-14 19:41:31,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 34.38461538461539) internal successors, (447), 13 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:31,958 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:31,958 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:41:31,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 19:41:31,958 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 19:41:31,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:31,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1219987278, now seen corresponding path program 1 times [2024-10-14 19:41:31,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:31,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457292588] [2024-10-14 19:41:31,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:31,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:32,689 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:32,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:32,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457292588] [2024-10-14 19:41:32,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457292588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:32,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:32,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 19:41:32,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128622510] [2024-10-14 19:41:32,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:32,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 19:41:32,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:32,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 19:41:32,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 19:41:33,429 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 71 [2024-10-14 19:41:33,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 64 transitions, 261 flow. Second operand has 12 states, 12 states have (on average 30.5) internal successors, (366), 12 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:33,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:33,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 71 [2024-10-14 19:41:33,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:33,780 INFO L124 PetriNetUnfolderBase]: 132/400 cut-off events. [2024-10-14 19:41:33,780 INFO L125 PetriNetUnfolderBase]: For 240/249 co-relation queries the response was YES. [2024-10-14 19:41:33,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 400 events. 132/400 cut-off events. For 240/249 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1919 event pairs, 41 based on Foata normal form. 12/381 useless extension candidates. Maximal degree in co-relation 922. Up to 191 conditions per place. [2024-10-14 19:41:33,782 INFO L140 encePairwiseOnDemand]: 59/71 looper letters, 61 selfloop transitions, 15 changer transitions 0/87 dead transitions. [2024-10-14 19:41:33,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 87 transitions, 469 flow [2024-10-14 19:41:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 19:41:33,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-14 19:41:33,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 414 transitions. [2024-10-14 19:41:33,784 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4859154929577465 [2024-10-14 19:41:33,784 INFO L175 Difference]: Start difference. First operand has 86 places, 64 transitions, 261 flow. Second operand 12 states and 414 transitions. [2024-10-14 19:41:33,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 87 transitions, 469 flow [2024-10-14 19:41:33,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 87 transitions, 457 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-14 19:41:33,786 INFO L231 Difference]: Finished difference. Result has 93 places, 65 transitions, 297 flow [2024-10-14 19:41:33,787 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=297, PETRI_PLACES=93, PETRI_TRANSITIONS=65} [2024-10-14 19:41:33,787 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 20 predicate places. [2024-10-14 19:41:33,787 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 65 transitions, 297 flow [2024-10-14 19:41:33,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 30.5) internal successors, (366), 12 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:33,788 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:33,788 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:41:33,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 19:41:33,788 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 19:41:33,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:33,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2086601707, now seen corresponding path program 1 times [2024-10-14 19:41:33,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:33,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476173804] [2024-10-14 19:41:33,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:33,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:41:34,102 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 19:41:34,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 19:41:34,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476173804] [2024-10-14 19:41:34,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476173804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:41:34,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:41:34,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 19:41:34,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447745893] [2024-10-14 19:41:34,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:41:34,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 19:41:34,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 19:41:34,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 19:41:34,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 19:41:34,291 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 71 [2024-10-14 19:41:34,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 65 transitions, 297 flow. Second operand has 7 states, 7 states have (on average 41.142857142857146) internal successors, (288), 7 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:34,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 19:41:34,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 71 [2024-10-14 19:41:34,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 19:41:34,386 INFO L124 PetriNetUnfolderBase]: 107/344 cut-off events. [2024-10-14 19:41:34,386 INFO L125 PetriNetUnfolderBase]: For 377/385 co-relation queries the response was YES. [2024-10-14 19:41:34,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 344 events. 107/344 cut-off events. For 377/385 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1707 event pairs, 30 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 854. Up to 222 conditions per place. [2024-10-14 19:41:34,388 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 51 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2024-10-14 19:41:34,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 72 transitions, 443 flow [2024-10-14 19:41:34,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:41:34,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 19:41:34,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2024-10-14 19:41:34,389 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.676056338028169 [2024-10-14 19:41:34,389 INFO L175 Difference]: Start difference. First operand has 93 places, 65 transitions, 297 flow. Second operand 4 states and 192 transitions. [2024-10-14 19:41:34,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 72 transitions, 443 flow [2024-10-14 19:41:34,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 72 transitions, 409 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-10-14 19:41:34,392 INFO L231 Difference]: Finished difference. Result has 85 places, 64 transitions, 271 flow [2024-10-14 19:41:34,392 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=85, PETRI_TRANSITIONS=64} [2024-10-14 19:41:34,393 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 12 predicate places. [2024-10-14 19:41:34,393 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 64 transitions, 271 flow [2024-10-14 19:41:34,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 41.142857142857146) internal successors, (288), 7 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:41:34,393 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 19:41:34,393 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:41:34,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 19:41:34,393 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-14 19:41:34,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:41:34,394 INFO L85 PathProgramCache]: Analyzing trace with hash -260143025, now seen corresponding path program 1 times [2024-10-14 19:41:34,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 19:41:34,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248179965] [2024-10-14 19:41:34,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:41:34,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 19:41:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:41:34,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 19:41:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 19:41:34,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 19:41:34,480 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 19:41:34,481 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 50 remaining) [2024-10-14 19:41:34,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2024-10-14 19:41:34,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2024-10-14 19:41:34,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2024-10-14 19:41:34,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2024-10-14 19:41:34,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2024-10-14 19:41:34,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2024-10-14 19:41:34,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2024-10-14 19:41:34,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2024-10-14 19:41:34,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2024-10-14 19:41:34,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2024-10-14 19:41:34,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2024-10-14 19:41:34,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2024-10-14 19:41:34,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2024-10-14 19:41:34,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2024-10-14 19:41:34,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2024-10-14 19:41:34,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2024-10-14 19:41:34,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2024-10-14 19:41:34,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2024-10-14 19:41:34,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2024-10-14 19:41:34,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2024-10-14 19:41:34,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2024-10-14 19:41:34,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2024-10-14 19:41:34,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2024-10-14 19:41:34,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2024-10-14 19:41:34,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (24 of 50 remaining) [2024-10-14 19:41:34,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 50 remaining) [2024-10-14 19:41:34,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2024-10-14 19:41:34,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2024-10-14 19:41:34,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2024-10-14 19:41:34,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2024-10-14 19:41:34,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2024-10-14 19:41:34,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2024-10-14 19:41:34,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2024-10-14 19:41:34,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2024-10-14 19:41:34,487 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2024-10-14 19:41:34,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2024-10-14 19:41:34,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2024-10-14 19:41:34,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2024-10-14 19:41:34,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2024-10-14 19:41:34,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2024-10-14 19:41:34,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2024-10-14 19:41:34,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2024-10-14 19:41:34,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2024-10-14 19:41:34,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2024-10-14 19:41:34,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2024-10-14 19:41:34,488 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2024-10-14 19:41:34,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2024-10-14 19:41:34,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2024-10-14 19:41:34,489 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 50 remaining) [2024-10-14 19:41:34,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 19:41:34,489 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:41:34,531 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 19:41:34,531 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 19:41:34,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:41:34 BasicIcfg [2024-10-14 19:41:34,536 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 19:41:34,536 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 19:41:34,536 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 19:41:34,537 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 19:41:34,537 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:41:23" (3/4) ... [2024-10-14 19:41:34,538 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 19:41:34,590 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 19:41:34,590 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 19:41:34,591 INFO L158 Benchmark]: Toolchain (without parser) took 12730.04ms. Allocated memory was 136.3MB in the beginning and 419.4MB in the end (delta: 283.1MB). Free memory was 62.4MB in the beginning and 172.8MB in the end (delta: -110.4MB). Peak memory consumption was 174.8MB. Max. memory is 16.1GB. [2024-10-14 19:41:34,591 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 136.3MB. Free memory is still 98.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:41:34,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 631.63ms. Allocated memory was 136.3MB in the beginning and 178.3MB in the end (delta: 41.9MB). Free memory was 62.1MB in the beginning and 120.6MB in the end (delta: -58.5MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2024-10-14 19:41:34,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.78ms. Allocated memory is still 178.3MB. Free memory was 120.6MB in the beginning and 117.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 19:41:34,591 INFO L158 Benchmark]: Boogie Preprocessor took 77.73ms. Allocated memory is still 178.3MB. Free memory was 117.4MB in the beginning and 114.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 19:41:34,592 INFO L158 Benchmark]: RCFGBuilder took 695.04ms. Allocated memory is still 178.3MB. Free memory was 114.5MB in the beginning and 129.1MB in the end (delta: -14.5MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-10-14 19:41:34,592 INFO L158 Benchmark]: TraceAbstraction took 11200.32ms. Allocated memory was 178.3MB in the beginning and 419.4MB in the end (delta: 241.2MB). Free memory was 128.0MB in the beginning and 178.0MB in the end (delta: -50.0MB). Peak memory consumption was 193.3MB. Max. memory is 16.1GB. [2024-10-14 19:41:34,592 INFO L158 Benchmark]: Witness Printer took 54.03ms. Allocated memory is still 419.4MB. Free memory was 178.0MB in the beginning and 172.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 19:41:34,593 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.16ms. Allocated memory is still 136.3MB. Free memory is still 98.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 631.63ms. Allocated memory was 136.3MB in the beginning and 178.3MB in the end (delta: 41.9MB). Free memory was 62.1MB in the beginning and 120.6MB in the end (delta: -58.5MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.78ms. Allocated memory is still 178.3MB. Free memory was 120.6MB in the beginning and 117.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.73ms. Allocated memory is still 178.3MB. Free memory was 117.4MB in the beginning and 114.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 695.04ms. Allocated memory is still 178.3MB. Free memory was 114.5MB in the beginning and 129.1MB in the end (delta: -14.5MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11200.32ms. Allocated memory was 178.3MB in the beginning and 419.4MB in the end (delta: 241.2MB). Free memory was 128.0MB in the beginning and 178.0MB in the end (delta: -50.0MB). Peak memory consumption was 193.3MB. Max. memory is 16.1GB. * Witness Printer took 54.03ms. Allocated memory is still 419.4MB. Free memory was 178.0MB in the beginning and 172.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1254] 0 int i = 0; VAL [i=0, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=1, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=2, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=3, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=4, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=5, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=6, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=7, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=8, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=9, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=10, mutex={1:0}, slot={2:0}] [L1254] COND FALSE 0 !(i < 10) [L1256] 0 int j = __VERIFIER_nondet_int(); [L1257] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1257] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1258] 0 struct s *p; [L1259] 0 pthread_t t1; [L1260] CALL, EXPR 0 new(1) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1260] RET, EXPR 0 new(1) [L1260] 0 slot[j] = new(1) [L1261] CALL, EXPR 0 new(2) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1261] RET, EXPR 0 new(2) [L1261] EXPR 0 slot[j] [L1261] CALL 0 list_add(new(2), slot[j]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [mutex={1:0}, slot={2:0}] [L1241] 0 node->next = temp [L1261] RET 0 list_add(new(2), slot[j]) [L1262] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [j=9, mutex={1:0}, slot={2:0}, t1=-1] [L1246] 1 int i = __VERIFIER_nondet_int(); [L1247] CALL 1 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 1 !(!cond) [L1247] RET 1 assume_abort_if_not(0 <= i && i < 10) [L1249] CALL, EXPR 1 new(3) [L1233] 1 struct s *p = malloc(sizeof(struct s)); [L1234] 1 p->datum = x VAL [\old(arg)={0:0}, arg={0:0}, i=8, mutex={1:0}, slot={2:0}] [L1235] 1 p->next = ((void *)0) [L1236] 1 return p; [L1249] RET, EXPR 1 new(3) [L1249] EXPR 1 slot[i] [L1249] CALL 1 list_add(new(3), slot[i]) [L1239] 1 list->next - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1253]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1262]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 96 locations, 50 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.1s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3152 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2273 mSDsluCounter, 1743 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1665 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8995 IncrementalHoareTripleChecker+Invalid, 9117 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 78 mSDtfsCounter, 8995 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=297occurred in iteration=17, InterpolantAutomatonStates: 109, 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.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 334 ConstructedInterpolants, 0 QuantifiedInterpolants, 2654 SizeOfPredicates, 0 NumberOfNonLiveVariables, 137 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 780/813 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-14 19:41:34,620 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)