./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/queue_ok_longer.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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:19:08,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:19:08,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:19:08,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:19:08,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:19:08,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:19:08,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:19:08,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:19:08,642 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:19:08,643 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:19:08,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:19:08,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:19:08,644 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:19:08,646 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:19:08,646 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:19:08,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:19:08,647 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:19:08,647 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:19:08,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:19:08,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:19:08,648 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:19:08,652 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:19:08,652 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:19:08,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:19:08,653 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:19:08,653 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:19:08,653 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:19:08,654 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:19:08,654 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:19:08,654 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:19:08,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:19:08,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:19:08,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:19:08,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:19:08,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:19:08,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:19:08,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:19:08,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:19:08,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:19:08,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:19:08,657 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:19:08,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:19:08,657 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2024-11-19 09:19:08,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:19:08,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:19:08,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:19:08,933 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:19:08,934 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:19:08,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_ok_longer.i [2024-11-19 09:19:10,339 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:19:10,612 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:19:10,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longer.i [2024-11-19 09:19:10,637 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20d4a8925/6edac3afa24945d6bb55d704a9dd1432/FLAG64ef7940b [2024-11-19 09:19:10,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20d4a8925/6edac3afa24945d6bb55d704a9dd1432 [2024-11-19 09:19:10,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:19:10,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:19:10,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:19:10,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:19:10,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:19:10,661 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:19:10" (1/1) ... [2024-11-19 09:19:10,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e0720e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:10, skipping insertion in model container [2024-11-19 09:19:10,664 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:19:10" (1/1) ... [2024-11-19 09:19:10,717 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:19:11,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:19:11,293 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:19:11,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:19:11,493 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:19:11,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:11 WrapperNode [2024-11-19 09:19:11,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:19:11,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:19:11,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:19:11,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:19:11,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:11" (1/1) ... [2024-11-19 09:19:11,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:11" (1/1) ... [2024-11-19 09:19:11,622 INFO L138 Inliner]: procedures = 274, calls = 854, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1001 [2024-11-19 09:19:11,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:19:11,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:19:11,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:19:11,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:19:11,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:11" (1/1) ... [2024-11-19 09:19:11,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:11" (1/1) ... [2024-11-19 09:19:11,653 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:11" (1/1) ... [2024-11-19 09:19:11,707 INFO L175 MemorySlicer]: Split 835 memory accesses to 4 slices as follows [2, 5, 402, 426]. 51 percent of accesses are in the largest equivalence class. The 810 initializations are split as follows [2, 5, 400, 403]. The 11 writes are split as follows [0, 0, 1, 10]. [2024-11-19 09:19:11,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:11" (1/1) ... [2024-11-19 09:19:11,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:11" (1/1) ... [2024-11-19 09:19:11,765 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:11" (1/1) ... [2024-11-19 09:19:11,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:11" (1/1) ... [2024-11-19 09:19:11,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:11" (1/1) ... [2024-11-19 09:19:11,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:11" (1/1) ... [2024-11-19 09:19:11,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:19:11,804 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:19:11,805 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:19:11,805 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:19:11,806 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:11" (1/1) ... [2024-11-19 09:19:11,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:19:11,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:19:11,850 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:19:11,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:19:11,902 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-19 09:19:11,902 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-19 09:19:11,903 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-19 09:19:11,903 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-19 09:19:11,903 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 09:19:11,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 09:19:11,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 09:19:11,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 09:19:11,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 09:19:11,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 09:19:11,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 09:19:11,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 09:19:11,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 09:19:11,904 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 09:19:11,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:19:11,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:19:11,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 09:19:11,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 09:19:11,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 09:19:11,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:19:11,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:19:11,907 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:19:12,055 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:19:12,057 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:19:13,380 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:19:13,380 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:19:20,024 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:19:20,025 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 09:19:20,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:19:20 BoogieIcfgContainer [2024-11-19 09:19:20,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:19:20,028 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:19:20,028 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:19:20,031 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:19:20,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:19:10" (1/3) ... [2024-11-19 09:19:20,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7982a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:19:20, skipping insertion in model container [2024-11-19 09:19:20,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:19:11" (2/3) ... [2024-11-19 09:19:20,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7982a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:19:20, skipping insertion in model container [2024-11-19 09:19:20,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:19:20" (3/3) ... [2024-11-19 09:19:20,035 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2024-11-19 09:19:20,056 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:19:20,056 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2024-11-19 09:19:20,056 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:19:20,183 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 09:19:20,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 129 transitions, 272 flow [2024-11-19 09:19:20,329 INFO L124 PetriNetUnfolderBase]: 11/127 cut-off events. [2024-11-19 09:19:20,331 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:19:20,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 127 events. 11/127 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 405 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 99. Up to 3 conditions per place. [2024-11-19 09:19:20,336 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 129 transitions, 272 flow [2024-11-19 09:19:20,342 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 126 transitions, 264 flow [2024-11-19 09:19:20,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:19:20,363 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;@27f913a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:19:20,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2024-11-19 09:19:20,414 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:19:20,414 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2024-11-19 09:19:20,414 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:19:20,415 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:19:20,416 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-11-19 09:19:20,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-19 09:19:20,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:19:20,421 INFO L85 PathProgramCache]: Analyzing trace with hash 69449, now seen corresponding path program 1 times [2024-11-19 09:19:20,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:19:20,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861710607] [2024-11-19 09:19:20,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:19:20,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:19:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:19:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:19:21,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:19:21,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861710607] [2024-11-19 09:19:21,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861710607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:19:21,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:19:21,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:19:21,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153672749] [2024-11-19 09:19:21,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:19:21,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:19:21,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:19:21,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:19:21,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:19:21,549 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 129 [2024-11-19 09:19:21,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 126 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:19:21,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:19:21,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 129 [2024-11-19 09:19:21,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:19:22,090 INFO L124 PetriNetUnfolderBase]: 1089/2984 cut-off events. [2024-11-19 09:19:22,091 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-19 09:19:22,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4727 conditions, 2984 events. 1089/2984 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 23575 event pairs, 839 based on Foata normal form. 68/2109 useless extension candidates. Maximal degree in co-relation 4570. Up to 1689 conditions per place. [2024-11-19 09:19:22,123 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 45 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2024-11-19 09:19:22,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 114 transitions, 334 flow [2024-11-19 09:19:22,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:19:22,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:19:22,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2024-11-19 09:19:22,141 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6873385012919897 [2024-11-19 09:19:22,144 INFO L175 Difference]: Start difference. First operand has 122 places, 126 transitions, 264 flow. Second operand 3 states and 266 transitions. [2024-11-19 09:19:22,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 114 transitions, 334 flow [2024-11-19 09:19:22,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 114 transitions, 326 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:19:22,152 INFO L231 Difference]: Finished difference. Result has 112 places, 114 transitions, 236 flow [2024-11-19 09:19:22,155 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=112, PETRI_TRANSITIONS=114} [2024-11-19 09:19:22,160 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -10 predicate places. [2024-11-19 09:19:22,160 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 114 transitions, 236 flow [2024-11-19 09:19:22,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:19:22,161 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:19:22,161 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-11-19 09:19:22,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:19:22,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-19 09:19:22,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:19:22,162 INFO L85 PathProgramCache]: Analyzing trace with hash 69450, now seen corresponding path program 1 times [2024-11-19 09:19:22,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:19:22,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993164933] [2024-11-19 09:19:22,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:19:22,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:19:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:19:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:19:22,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:19:22,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993164933] [2024-11-19 09:19:22,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993164933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:19:22,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:19:22,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:19:22,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571970847] [2024-11-19 09:19:22,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:19:22,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:19:22,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:19:22,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:19:22,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:19:22,905 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 129 [2024-11-19 09:19:22,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 114 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:19:22,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:19:22,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 129 [2024-11-19 09:19:22,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:19:23,281 INFO L124 PetriNetUnfolderBase]: 1089/2981 cut-off events. [2024-11-19 09:19:23,281 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-19 09:19:23,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4690 conditions, 2981 events. 1089/2981 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 23571 event pairs, 839 based on Foata normal form. 3/2043 useless extension candidates. Maximal degree in co-relation 4679. Up to 1689 conditions per place. [2024-11-19 09:19:23,306 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 45 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2024-11-19 09:19:23,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 111 transitions, 324 flow [2024-11-19 09:19:23,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:19:23,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:19:23,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2024-11-19 09:19:23,309 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6795865633074936 [2024-11-19 09:19:23,309 INFO L175 Difference]: Start difference. First operand has 112 places, 114 transitions, 236 flow. Second operand 3 states and 263 transitions. [2024-11-19 09:19:23,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 111 transitions, 324 flow [2024-11-19 09:19:23,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 111 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:19:23,312 INFO L231 Difference]: Finished difference. Result has 109 places, 111 transitions, 230 flow [2024-11-19 09:19:23,312 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=109, PETRI_TRANSITIONS=111} [2024-11-19 09:19:23,313 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -13 predicate places. [2024-11-19 09:19:23,313 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 111 transitions, 230 flow [2024-11-19 09:19:23,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:19:23,314 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:19:23,314 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 09:19:23,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:19:23,314 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-19 09:19:23,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:19:23,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2071095474, now seen corresponding path program 1 times [2024-11-19 09:19:23,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:19:23,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413755796] [2024-11-19 09:19:23,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:19:23,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:19:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:19:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:19:23,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:19:23,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413755796] [2024-11-19 09:19:23,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413755796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:19:23,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:19:23,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:19:23,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456086899] [2024-11-19 09:19:23,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:19:23,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:19:23,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:19:23,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:19:23,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:19:23,672 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2024-11-19 09:19:23,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 111 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:19:23,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:19:23,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2024-11-19 09:19:23,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:19:24,132 INFO L124 PetriNetUnfolderBase]: 1089/2979 cut-off events. [2024-11-19 09:19:24,133 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-19 09:19:24,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4688 conditions, 2979 events. 1089/2979 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 23545 event pairs, 839 based on Foata normal form. 1/2041 useless extension candidates. Maximal degree in co-relation 4677. Up to 1688 conditions per place. [2024-11-19 09:19:24,152 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 44 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2024-11-19 09:19:24,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 109 transitions, 320 flow [2024-11-19 09:19:24,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:19:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:19:24,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2024-11-19 09:19:24,154 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6531007751937985 [2024-11-19 09:19:24,154 INFO L175 Difference]: Start difference. First operand has 109 places, 111 transitions, 230 flow. Second operand 4 states and 337 transitions. [2024-11-19 09:19:24,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 109 transitions, 320 flow [2024-11-19 09:19:24,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 109 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:19:24,157 INFO L231 Difference]: Finished difference. Result has 108 places, 109 transitions, 228 flow [2024-11-19 09:19:24,158 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=108, PETRI_TRANSITIONS=109} [2024-11-19 09:19:24,158 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -14 predicate places. [2024-11-19 09:19:24,159 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 109 transitions, 228 flow [2024-11-19 09:19:24,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:19:24,159 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:19:24,159 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 09:19:24,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:19:24,160 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-19 09:19:24,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:19:24,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2071095475, now seen corresponding path program 1 times [2024-11-19 09:19:24,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:19:24,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383121627] [2024-11-19 09:19:24,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:19:24,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:19:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:19:24,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:19:24,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:19:24,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383121627] [2024-11-19 09:19:24,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383121627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:19:24,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:19:24,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:19:24,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321088124] [2024-11-19 09:19:24,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:19:24,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:19:24,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:19:24,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:19:24,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:19:24,728 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2024-11-19 09:19:24,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 109 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:19:24,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:19:24,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2024-11-19 09:19:24,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:19:25,077 INFO L124 PetriNetUnfolderBase]: 1089/2977 cut-off events. [2024-11-19 09:19:25,078 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-19 09:19:25,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4687 conditions, 2977 events. 1089/2977 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 23568 event pairs, 839 based on Foata normal form. 2/2041 useless extension candidates. Maximal degree in co-relation 4672. Up to 1688 conditions per place. [2024-11-19 09:19:25,099 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 44 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2024-11-19 09:19:25,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 107 transitions, 318 flow [2024-11-19 09:19:25,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:19:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:19:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2024-11-19 09:19:25,101 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6531007751937985 [2024-11-19 09:19:25,101 INFO L175 Difference]: Start difference. First operand has 108 places, 109 transitions, 228 flow. Second operand 4 states and 337 transitions. [2024-11-19 09:19:25,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 107 transitions, 318 flow [2024-11-19 09:19:25,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 107 transitions, 312 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:19:25,104 INFO L231 Difference]: Finished difference. Result has 106 places, 107 transitions, 224 flow [2024-11-19 09:19:25,104 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=106, PETRI_TRANSITIONS=107} [2024-11-19 09:19:25,105 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -16 predicate places. [2024-11-19 09:19:25,105 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 107 transitions, 224 flow [2024-11-19 09:19:25,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:19:25,106 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:19:25,106 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:19:25,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:19:25,106 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-19 09:19:25,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:19:25,107 INFO L85 PathProgramCache]: Analyzing trace with hash 902343804, now seen corresponding path program 1 times [2024-11-19 09:19:25,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:19:25,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854555959] [2024-11-19 09:19:25,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:19:25,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:19:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:19:25,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:19:25,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:19:25,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854555959] [2024-11-19 09:19:25,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854555959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:19:25,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:19:25,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:19:25,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981129747] [2024-11-19 09:19:25,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:19:25,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:19:25,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:19:25,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:19:25,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:19:25,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 129 [2024-11-19 09:19:25,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 107 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:19:25,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:19:25,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 129 [2024-11-19 09:19:25,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:19:26,165 INFO L124 PetriNetUnfolderBase]: 1046/2622 cut-off events. [2024-11-19 09:19:26,166 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-19 09:19:26,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4287 conditions, 2622 events. 1046/2622 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 19408 event pairs, 426 based on Foata normal form. 120/2116 useless extension candidates. Maximal degree in co-relation 4272. Up to 882 conditions per place. [2024-11-19 09:19:26,191 INFO L140 encePairwiseOnDemand]: 118/129 looper letters, 67 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2024-11-19 09:19:26,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 122 transitions, 395 flow [2024-11-19 09:19:26,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:19:26,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:19:26,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 342 transitions. [2024-11-19 09:19:26,193 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6627906976744186 [2024-11-19 09:19:26,194 INFO L175 Difference]: Start difference. First operand has 106 places, 107 transitions, 224 flow. Second operand 4 states and 342 transitions. [2024-11-19 09:19:26,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 122 transitions, 395 flow [2024-11-19 09:19:26,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 122 transitions, 389 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:19:26,197 INFO L231 Difference]: Finished difference. Result has 98 places, 99 transitions, 208 flow [2024-11-19 09:19:26,197 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=98, PETRI_TRANSITIONS=99} [2024-11-19 09:19:26,198 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2024-11-19 09:19:26,199 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 99 transitions, 208 flow [2024-11-19 09:19:26,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:19:26,199 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:19:26,199 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:19:26,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:19:26,200 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-19 09:19:26,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:19:26,201 INFO L85 PathProgramCache]: Analyzing trace with hash 902343805, now seen corresponding path program 1 times [2024-11-19 09:19:26,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:19:26,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32400165] [2024-11-19 09:19:26,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:19:26,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:19:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:19:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:19:26,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:19:26,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32400165] [2024-11-19 09:19:26,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32400165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:19:26,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:19:26,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:19:26,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270665420] [2024-11-19 09:19:26,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:19:26,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:19:26,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:19:26,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:19:26,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:19:26,919 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 129 [2024-11-19 09:19:26,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 99 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:19:26,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:19:26,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 129 [2024-11-19 09:19:26,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:19:27,376 INFO L124 PetriNetUnfolderBase]: 1046/2354 cut-off events. [2024-11-19 09:19:27,376 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2024-11-19 09:19:27,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4097 conditions, 2354 events. 1046/2354 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 15823 event pairs, 426 based on Foata normal form. 120/2000 useless extension candidates. Maximal degree in co-relation 1953. Up to 882 conditions per place. [2024-11-19 09:19:27,390 INFO L140 encePairwiseOnDemand]: 119/129 looper letters, 67 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2024-11-19 09:19:27,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 115 transitions, 381 flow [2024-11-19 09:19:27,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:19:27,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:19:27,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 345 transitions. [2024-11-19 09:19:27,392 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6686046511627907 [2024-11-19 09:19:27,392 INFO L175 Difference]: Start difference. First operand has 98 places, 99 transitions, 208 flow. Second operand 4 states and 345 transitions. [2024-11-19 09:19:27,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 115 transitions, 381 flow [2024-11-19 09:19:27,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 115 transitions, 375 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:19:27,395 INFO L231 Difference]: Finished difference. Result has 91 places, 92 transitions, 194 flow [2024-11-19 09:19:27,395 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=91, PETRI_TRANSITIONS=92} [2024-11-19 09:19:27,396 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -31 predicate places. [2024-11-19 09:19:27,396 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 92 transitions, 194 flow [2024-11-19 09:19:27,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:19:27,397 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:19:27,397 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:19:27,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:19:27,397 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-19 09:19:27,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:19:27,398 INFO L85 PathProgramCache]: Analyzing trace with hash -2092110920, now seen corresponding path program 1 times [2024-11-19 09:19:27,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:19:27,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260726397] [2024-11-19 09:19:27,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:19:27,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:19:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:19:28,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:19:28,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:19:28,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260726397] [2024-11-19 09:19:28,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260726397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:19:28,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:19:28,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:19:28,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764085372] [2024-11-19 09:19:28,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:19:28,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:19:28,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:19:28,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:19:28,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:19:29,306 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 129 [2024-11-19 09:19:29,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 92 transitions, 194 flow. Second operand has 8 states, 8 states have (on average 59.625) internal successors, (477), 8 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:19:29,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:19:29,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 129 [2024-11-19 09:19:29,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:19:30,147 INFO L124 PetriNetUnfolderBase]: 2065/4255 cut-off events. [2024-11-19 09:19:30,147 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-11-19 09:19:30,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7679 conditions, 4255 events. 2065/4255 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 29549 event pairs, 289 based on Foata normal form. 0/3449 useless extension candidates. Maximal degree in co-relation 2484. Up to 2157 conditions per place. [2024-11-19 09:19:30,173 INFO L140 encePairwiseOnDemand]: 119/129 looper letters, 131 selfloop transitions, 12 changer transitions 0/182 dead transitions. [2024-11-19 09:19:30,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 182 transitions, 667 flow [2024-11-19 09:19:30,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:19:30,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:19:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 609 transitions. [2024-11-19 09:19:30,176 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5901162790697675 [2024-11-19 09:19:30,177 INFO L175 Difference]: Start difference. First operand has 91 places, 92 transitions, 194 flow. Second operand 8 states and 609 transitions. [2024-11-19 09:19:30,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 182 transitions, 667 flow [2024-11-19 09:19:30,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 182 transitions, 659 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:19:30,183 INFO L231 Difference]: Finished difference. Result has 99 places, 102 transitions, 264 flow [2024-11-19 09:19:30,183 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=264, PETRI_PLACES=99, PETRI_TRANSITIONS=102} [2024-11-19 09:19:30,184 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -23 predicate places. [2024-11-19 09:19:30,184 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 102 transitions, 264 flow [2024-11-19 09:19:30,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 59.625) internal successors, (477), 8 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:19:30,185 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:19:30,185 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:19:30,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:19:30,185 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-19 09:19:30,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:19:30,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1088727253, now seen corresponding path program 1 times [2024-11-19 09:19:30,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:19:30,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559208795] [2024-11-19 09:19:30,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:19:30,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:19:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:19:30,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:19:30,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:19:30,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559208795] [2024-11-19 09:19:30,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559208795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:19:30,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:19:30,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:19:30,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688022576] [2024-11-19 09:19:30,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:19:30,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:19:30,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:19:30,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:19:30,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:19:30,408 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2024-11-19 09:19:30,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 102 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 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-11-19 09:19:30,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:19:30,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2024-11-19 09:19:30,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:19:30,635 INFO L124 PetriNetUnfolderBase]: 692/1652 cut-off events. [2024-11-19 09:19:30,635 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2024-11-19 09:19:30,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3115 conditions, 1652 events. 692/1652 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 10240 event pairs, 446 based on Foata normal form. 43/1432 useless extension candidates. Maximal degree in co-relation 3072. Up to 693 conditions per place. [2024-11-19 09:19:30,643 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 59 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2024-11-19 09:19:30,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 109 transitions, 393 flow [2024-11-19 09:19:30,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:19:30,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:19:30,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2024-11-19 09:19:30,646 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7260981912144703 [2024-11-19 09:19:30,647 INFO L175 Difference]: Start difference. First operand has 99 places, 102 transitions, 264 flow. Second operand 3 states and 281 transitions. [2024-11-19 09:19:30,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 109 transitions, 393 flow [2024-11-19 09:19:30,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 109 transitions, 387 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-11-19 09:19:30,651 INFO L231 Difference]: Finished difference. Result has 98 places, 98 transitions, 249 flow [2024-11-19 09:19:30,652 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=249, PETRI_PLACES=98, PETRI_TRANSITIONS=98} [2024-11-19 09:19:30,653 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2024-11-19 09:19:30,655 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 98 transitions, 249 flow [2024-11-19 09:19:30,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 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-11-19 09:19:30,655 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:19:30,655 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:19:30,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 09:19:30,656 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-19 09:19:30,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:19:30,656 INFO L85 PathProgramCache]: Analyzing trace with hash 230754673, now seen corresponding path program 1 times [2024-11-19 09:19:30,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:19:30,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884500499] [2024-11-19 09:19:30,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:19:30,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:19:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:19:30,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:19:30,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:19:30,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884500499] [2024-11-19 09:19:30,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884500499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:19:30,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:19:30,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:19:30,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208560769] [2024-11-19 09:19:30,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:19:30,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:19:30,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:19:30,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:19:30,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:19:30,824 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2024-11-19 09:19:30,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 98 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:19:30,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:19:30,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2024-11-19 09:19:30,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:19:31,095 INFO L124 PetriNetUnfolderBase]: 572/1382 cut-off events. [2024-11-19 09:19:31,096 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-11-19 09:19:31,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2663 conditions, 1382 events. 572/1382 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 7625 event pairs, 380 based on Foata normal form. 12/1194 useless extension candidates. Maximal degree in co-relation 1698. Up to 753 conditions per place. [2024-11-19 09:19:31,103 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 62 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2024-11-19 09:19:31,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 111 transitions, 401 flow [2024-11-19 09:19:31,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:19:31,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:19:31,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2024-11-19 09:19:31,105 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7416020671834626 [2024-11-19 09:19:31,105 INFO L175 Difference]: Start difference. First operand has 98 places, 98 transitions, 249 flow. Second operand 3 states and 287 transitions. [2024-11-19 09:19:31,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 111 transitions, 401 flow [2024-11-19 09:19:31,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 111 transitions, 393 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-19 09:19:31,112 INFO L231 Difference]: Finished difference. Result has 99 places, 98 transitions, 248 flow [2024-11-19 09:19:31,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=99, PETRI_TRANSITIONS=98} [2024-11-19 09:19:31,112 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -23 predicate places. [2024-11-19 09:19:31,113 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 98 transitions, 248 flow [2024-11-19 09:19:31,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:19:31,114 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:19:31,114 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:19:31,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:19:31,115 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-19 09:19:31,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:19:31,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1879953541, now seen corresponding path program 1 times [2024-11-19 09:19:31,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:19:31,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108069422] [2024-11-19 09:19:31,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:19:31,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:19:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:19:31,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:19:31,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:19:31,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108069422] [2024-11-19 09:19:31,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108069422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:19:31,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:19:31,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:19:31,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840510723] [2024-11-19 09:19:31,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:19:31,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:19:31,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:19:31,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:19:31,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:19:31,445 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2024-11-19 09:19:31,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 98 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:19:31,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:19:31,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2024-11-19 09:19:31,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:19:31,625 INFO L124 PetriNetUnfolderBase]: 572/1349 cut-off events. [2024-11-19 09:19:31,626 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2024-11-19 09:19:31,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2660 conditions, 1349 events. 572/1349 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7253 event pairs, 515 based on Foata normal form. 31/1215 useless extension candidates. Maximal degree in co-relation 809. Up to 1007 conditions per place. [2024-11-19 09:19:31,633 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 50 selfloop transitions, 1 changer transitions 0/96 dead transitions. [2024-11-19 09:19:31,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 96 transitions, 346 flow [2024-11-19 09:19:31,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:19:31,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:19:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2024-11-19 09:19:31,634 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6847545219638242 [2024-11-19 09:19:31,634 INFO L175 Difference]: Start difference. First operand has 99 places, 98 transitions, 248 flow. Second operand 3 states and 265 transitions. [2024-11-19 09:19:31,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 96 transitions, 346 flow [2024-11-19 09:19:31,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 96 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:19:31,637 INFO L231 Difference]: Finished difference. Result has 98 places, 96 transitions, 244 flow [2024-11-19 09:19:31,638 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=98, PETRI_TRANSITIONS=96} [2024-11-19 09:19:31,639 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2024-11-19 09:19:31,640 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 96 transitions, 244 flow [2024-11-19 09:19:31,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:19:31,640 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:19:31,640 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:19:31,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:19:31,641 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-19 09:19:31,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:19:31,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1879953542, now seen corresponding path program 1 times [2024-11-19 09:19:31,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:19:31,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120637643] [2024-11-19 09:19:31,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:19:31,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:19:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:19:31,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:19:31,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:19:31,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120637643] [2024-11-19 09:19:31,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120637643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:19:31,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:19:31,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:19:31,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819091853] [2024-11-19 09:19:31,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:19:31,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:19:31,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:19:31,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:19:31,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:19:32,060 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 129 [2024-11-19 09:19:32,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 96 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:19:32,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:19:32,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 129 [2024-11-19 09:19:32,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:19:32,302 INFO L124 PetriNetUnfolderBase]: 587/1354 cut-off events. [2024-11-19 09:19:32,303 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-11-19 09:19:32,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2686 conditions, 1354 events. 587/1354 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7192 event pairs, 395 based on Foata normal form. 12/1197 useless extension candidates. Maximal degree in co-relation 2674. Up to 779 conditions per place. [2024-11-19 09:19:32,309 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 62 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2024-11-19 09:19:32,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 109 transitions, 401 flow [2024-11-19 09:19:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:19:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:19:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 358 transitions. [2024-11-19 09:19:32,311 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6937984496124031 [2024-11-19 09:19:32,311 INFO L175 Difference]: Start difference. First operand has 98 places, 96 transitions, 244 flow. Second operand 4 states and 358 transitions. [2024-11-19 09:19:32,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 109 transitions, 401 flow [2024-11-19 09:19:32,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 109 transitions, 400 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:19:32,314 INFO L231 Difference]: Finished difference. Result has 101 places, 96 transitions, 253 flow [2024-11-19 09:19:32,314 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=101, PETRI_TRANSITIONS=96} [2024-11-19 09:19:32,315 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -21 predicate places. [2024-11-19 09:19:32,315 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 96 transitions, 253 flow [2024-11-19 09:19:32,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:19:32,315 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:19:32,316 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:19:32,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 09:19:32,316 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-19 09:19:32,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:19:32,316 INFO L85 PathProgramCache]: Analyzing trace with hash -675303991, now seen corresponding path program 1 times [2024-11-19 09:19:32,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:19:32,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518558242] [2024-11-19 09:19:32,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:19:32,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:19:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:19:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:19:33,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:19:33,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518558242] [2024-11-19 09:19:33,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518558242] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:19:33,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260676953] [2024-11-19 09:19:33,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:19:33,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:19:33,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:19:33,296 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:19:33,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 09:19:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:19:33,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 1849 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 09:19:33,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:19:33,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 09:19:33,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:19:33,976 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:19:34,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-19 09:19:34,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:19:34,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:19:34,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:19:34,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260676953] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:19:34,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:19:34,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2024-11-19 09:19:34,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011142437] [2024-11-19 09:19:34,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:19:34,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 09:19:34,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:19:34,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 09:19:34,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-19 09:19:35,481 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 129 [2024-11-19 09:19:35,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 96 transitions, 253 flow. Second operand has 17 states, 17 states have (on average 64.05882352941177) internal successors, (1089), 17 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:19:35,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:19:35,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 129 [2024-11-19 09:19:35,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:19:36,192 INFO L124 PetriNetUnfolderBase]: 1005/2167 cut-off events. [2024-11-19 09:19:36,192 INFO L125 PetriNetUnfolderBase]: For 169/169 co-relation queries the response was YES. [2024-11-19 09:19:36,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4471 conditions, 2167 events. 1005/2167 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 12911 event pairs, 183 based on Foata normal form. 12/1955 useless extension candidates. Maximal degree in co-relation 4457. Up to 471 conditions per place. [2024-11-19 09:19:36,208 INFO L140 encePairwiseOnDemand]: 120/129 looper letters, 127 selfloop transitions, 14 changer transitions 0/177 dead transitions. [2024-11-19 09:19:36,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 177 transitions, 731 flow [2024-11-19 09:19:36,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:19:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:19:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 738 transitions. [2024-11-19 09:19:36,211 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5720930232558139 [2024-11-19 09:19:36,211 INFO L175 Difference]: Start difference. First operand has 101 places, 96 transitions, 253 flow. Second operand 10 states and 738 transitions. [2024-11-19 09:19:36,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 177 transitions, 731 flow [2024-11-19 09:19:36,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 177 transitions, 723 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:19:36,217 INFO L231 Difference]: Finished difference. Result has 111 places, 103 transitions, 329 flow [2024-11-19 09:19:36,217 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=329, PETRI_PLACES=111, PETRI_TRANSITIONS=103} [2024-11-19 09:19:36,218 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -11 predicate places. [2024-11-19 09:19:36,220 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 103 transitions, 329 flow [2024-11-19 09:19:36,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 64.05882352941177) internal successors, (1089), 17 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:19:36,221 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:19:36,221 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:19:36,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 09:19:36,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-19 09:19:36,423 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-19 09:19:36,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:19:36,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1787894202, now seen corresponding path program 1 times [2024-11-19 09:19:36,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:19:36,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826905969] [2024-11-19 09:19:36,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:19:36,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:19:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:19:38,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:19:38,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:19:38,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826905969] [2024-11-19 09:19:38,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826905969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:19:38,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176358881] [2024-11-19 09:19:38,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:19:38,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:19:38,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:19:38,591 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:19:38,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 09:19:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:19:38,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 1856 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-19 09:19:38,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:19:38,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 09:19:38,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-19 09:19:39,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:19:39,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:19:39,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2024-11-19 09:19:39,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-19 09:19:39,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 09:19:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:19:39,431 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:20:00,169 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse5 (select .cse3 .cse2))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_172 Int)) (<= (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse0 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_172))) (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse0 .cse2) 1)))) |c_~#queue~0.base|) .cse4) 4) 4) (select |c_#length| |c_~#queue~0.base|))) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_172 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_172))) (store (store .cse6 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 (+ (select .cse6 .cse2) 1)))) |c_~#queue~0.base|) .cse4) 4)))) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|)))))) is different from false [2024-11-19 09:20:04,213 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#3| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select .cse0 .cse1))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (or (forall ((v_ArrVal_172 Int)) (<= 0 (+ (* (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_172) .cse1) 4) |c_~#queue~0.offset| 4))) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (or (forall ((v_ArrVal_172 Int)) (<= (+ (* (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_172) .cse1) 4) |c_~#queue~0.offset| 8) (select |c_#length| |c_~#queue~0.base|))) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|)))))) is different from false [2024-11-19 09:20:08,465 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (store |c_#memory_int#3| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int#3| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) 0)) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse1 .cse2))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) (forall ((v_ArrVal_172 Int)) (<= 0 (+ (* (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_172) .cse2) 4) |c_~#queue~0.offset| 4))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) (forall ((v_ArrVal_172 Int)) (<= (+ (* (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_172) .cse2) 4) |c_~#queue~0.offset| 8) (select |c_#length| |c_~#queue~0.base|)))))))) is different from false [2024-11-19 09:20:08,553 INFO L349 Elim1Store]: treesize reduction 47, result has 52.5 percent of original size [2024-11-19 09:20:08,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 146 [2024-11-19 09:20:08,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:20:08,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 73 [2024-11-19 09:20:08,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 09:20:08,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:20:08,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 60 [2024-11-19 09:20:08,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:20:08,793 INFO L349 Elim1Store]: treesize reduction 57, result has 26.9 percent of original size [2024-11-19 09:20:08,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 89 [2024-11-19 09:20:08,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2024-11-19 09:20:08,811 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:20:08,828 INFO L349 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2024-11-19 09:20:08,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 23 [2024-11-19 09:20:08,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-19 09:20:08,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176358881] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:20:08,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:20:08,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2024-11-19 09:20:08,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739974039] [2024-11-19 09:20:08,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:20:08,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-19 09:20:08,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:08,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-19 09:20:08,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=741, Unknown=7, NotChecked=174, Total=1056 [2024-11-19 09:20:09,133 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 129 [2024-11-19 09:20:09,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 329 flow. Second operand has 33 states, 33 states have (on average 28.363636363636363) internal successors, (936), 33 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:20:09,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:09,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 129 [2024-11-19 09:20:09,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:12,458 INFO L124 PetriNetUnfolderBase]: 2344/4499 cut-off events. [2024-11-19 09:20:12,458 INFO L125 PetriNetUnfolderBase]: For 787/787 co-relation queries the response was YES. [2024-11-19 09:20:12,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10188 conditions, 4499 events. 2344/4499 cut-off events. For 787/787 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 26030 event pairs, 443 based on Foata normal form. 24/4198 useless extension candidates. Maximal degree in co-relation 10170. Up to 1756 conditions per place. [2024-11-19 09:20:12,486 INFO L140 encePairwiseOnDemand]: 116/129 looper letters, 224 selfloop transitions, 28 changer transitions 0/270 dead transitions. [2024-11-19 09:20:12,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 270 transitions, 1286 flow [2024-11-19 09:20:12,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 09:20:12,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-19 09:20:12,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 655 transitions. [2024-11-19 09:20:12,489 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3173449612403101 [2024-11-19 09:20:12,489 INFO L175 Difference]: Start difference. First operand has 111 places, 103 transitions, 329 flow. Second operand 16 states and 655 transitions. [2024-11-19 09:20:12,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 270 transitions, 1286 flow [2024-11-19 09:20:12,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 270 transitions, 1265 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-19 09:20:12,497 INFO L231 Difference]: Finished difference. Result has 128 places, 123 transitions, 537 flow [2024-11-19 09:20:12,498 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=537, PETRI_PLACES=128, PETRI_TRANSITIONS=123} [2024-11-19 09:20:12,498 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 6 predicate places. [2024-11-19 09:20:12,499 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 123 transitions, 537 flow [2024-11-19 09:20:12,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 28.363636363636363) internal successors, (936), 33 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:20:12,499 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:12,499 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:12,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 09:20:12,700 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,SelfDestructingSolverStorable12 [2024-11-19 09:20:12,701 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-19 09:20:12,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:12,702 INFO L85 PathProgramCache]: Analyzing trace with hash 2096467843, now seen corresponding path program 1 times [2024-11-19 09:20:12,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:12,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22535607] [2024-11-19 09:20:12,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:12,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:12,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:12,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:12,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22535607] [2024-11-19 09:20:12,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22535607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:12,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:12,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:20:12,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438758616] [2024-11-19 09:20:12,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:12,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:20:12,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:12,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:20:12,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:20:12,882 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 129 [2024-11-19 09:20:12,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 123 transitions, 537 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:20:12,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:12,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 129 [2024-11-19 09:20:12,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:13,306 INFO L124 PetriNetUnfolderBase]: 1675/3817 cut-off events. [2024-11-19 09:20:13,306 INFO L125 PetriNetUnfolderBase]: For 1533/1533 co-relation queries the response was YES. [2024-11-19 09:20:13,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8856 conditions, 3817 events. 1675/3817 cut-off events. For 1533/1533 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 25032 event pairs, 1526 based on Foata normal form. 11/3375 useless extension candidates. Maximal degree in co-relation 8833. Up to 2934 conditions per place. [2024-11-19 09:20:13,334 INFO L140 encePairwiseOnDemand]: 127/129 looper letters, 70 selfloop transitions, 1 changer transitions 3/122 dead transitions. [2024-11-19 09:20:13,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 122 transitions, 681 flow [2024-11-19 09:20:13,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:20:13,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:20:13,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2024-11-19 09:20:13,336 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2024-11-19 09:20:13,336 INFO L175 Difference]: Start difference. First operand has 128 places, 123 transitions, 537 flow. Second operand 3 states and 267 transitions. [2024-11-19 09:20:13,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 122 transitions, 681 flow [2024-11-19 09:20:13,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 122 transitions, 647 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-11-19 09:20:13,347 INFO L231 Difference]: Finished difference. Result has 123 places, 119 transitions, 495 flow [2024-11-19 09:20:13,347 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=495, PETRI_PLACES=123, PETRI_TRANSITIONS=119} [2024-11-19 09:20:13,348 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 1 predicate places. [2024-11-19 09:20:13,349 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 119 transitions, 495 flow [2024-11-19 09:20:13,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:20:13,349 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:13,349 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:13,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 09:20:13,349 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-19 09:20:13,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:13,350 INFO L85 PathProgramCache]: Analyzing trace with hash -580366467, now seen corresponding path program 1 times [2024-11-19 09:20:13,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:13,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214408283] [2024-11-19 09:20:13,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:13,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:13,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:13,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:13,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214408283] [2024-11-19 09:20:13,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214408283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:20:13,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571713119] [2024-11-19 09:20:13,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:13,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:20:13,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:20:13,506 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:20:13,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 09:20:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:13,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 1874 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:20:13,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:20:13,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 09:20:13,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:20:13,851 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:20:13,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571713119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:13,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 09:20:13,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-19 09:20:13,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133476869] [2024-11-19 09:20:13,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:13,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:20:13,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:13,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:20:13,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:20:13,853 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2024-11-19 09:20:13,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 119 transitions, 495 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:20:13,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:13,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2024-11-19 09:20:13,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:14,289 INFO L124 PetriNetUnfolderBase]: 1101/2780 cut-off events. [2024-11-19 09:20:14,289 INFO L125 PetriNetUnfolderBase]: For 1008/1008 co-relation queries the response was YES. [2024-11-19 09:20:14,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6458 conditions, 2780 events. 1101/2780 cut-off events. For 1008/1008 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 17216 event pairs, 177 based on Foata normal form. 116/2571 useless extension candidates. Maximal degree in co-relation 6435. Up to 1708 conditions per place. [2024-11-19 09:20:14,303 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 75 selfloop transitions, 4 changer transitions 0/127 dead transitions. [2024-11-19 09:20:14,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 127 transitions, 671 flow [2024-11-19 09:20:14,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:20:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:20:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2024-11-19 09:20:14,305 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7157622739018088 [2024-11-19 09:20:14,305 INFO L175 Difference]: Start difference. First operand has 123 places, 119 transitions, 495 flow. Second operand 3 states and 277 transitions. [2024-11-19 09:20:14,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 127 transitions, 671 flow [2024-11-19 09:20:14,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 127 transitions, 670 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:20:14,313 INFO L231 Difference]: Finished difference. Result has 122 places, 119 transitions, 502 flow [2024-11-19 09:20:14,313 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=122, PETRI_TRANSITIONS=119} [2024-11-19 09:20:14,314 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 0 predicate places. [2024-11-19 09:20:14,314 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 119 transitions, 502 flow [2024-11-19 09:20:14,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:20:14,314 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:14,314 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:14,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 09:20:14,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:20:14,519 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-19 09:20:14,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:14,519 INFO L85 PathProgramCache]: Analyzing trace with hash 467214656, now seen corresponding path program 1 times [2024-11-19 09:20:14,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:14,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947311396] [2024-11-19 09:20:14,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:14,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:14,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:14,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:14,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947311396] [2024-11-19 09:20:14,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947311396] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:20:14,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083925989] [2024-11-19 09:20:14,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:14,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:20:14,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:20:14,722 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:20:14,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 09:20:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:15,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 1880 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:20:15,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:20:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:15,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:20:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:15,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083925989] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:20:15,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:20:15,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-19 09:20:15,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000089793] [2024-11-19 09:20:15,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:20:15,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:20:15,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:15,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:20:15,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:20:15,110 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2024-11-19 09:20:15,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 119 transitions, 502 flow. Second operand has 7 states, 7 states have (on average 79.85714285714286) internal successors, (559), 7 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:20:15,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:15,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2024-11-19 09:20:15,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:15,556 INFO L124 PetriNetUnfolderBase]: 1414/3417 cut-off events. [2024-11-19 09:20:15,556 INFO L125 PetriNetUnfolderBase]: For 1866/1866 co-relation queries the response was YES. [2024-11-19 09:20:15,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8816 conditions, 3417 events. 1414/3417 cut-off events. For 1866/1866 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 20166 event pairs, 439 based on Foata normal form. 80/3171 useless extension candidates. Maximal degree in co-relation 8793. Up to 914 conditions per place. [2024-11-19 09:20:15,576 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 117 selfloop transitions, 9 changer transitions 0/174 dead transitions. [2024-11-19 09:20:15,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 174 transitions, 1010 flow [2024-11-19 09:20:15,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:20:15,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:20:15,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 543 transitions. [2024-11-19 09:20:15,579 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7015503875968992 [2024-11-19 09:20:15,579 INFO L175 Difference]: Start difference. First operand has 122 places, 119 transitions, 502 flow. Second operand 6 states and 543 transitions. [2024-11-19 09:20:15,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 174 transitions, 1010 flow [2024-11-19 09:20:15,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 174 transitions, 1006 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:20:15,590 INFO L231 Difference]: Finished difference. Result has 130 places, 124 transitions, 579 flow [2024-11-19 09:20:15,590 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=579, PETRI_PLACES=130, PETRI_TRANSITIONS=124} [2024-11-19 09:20:15,590 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 8 predicate places. [2024-11-19 09:20:15,590 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 124 transitions, 579 flow [2024-11-19 09:20:15,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.85714285714286) internal successors, (559), 7 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:20:15,591 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:15,591 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:15,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 09:20:15,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-19 09:20:15,792 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-19 09:20:15,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:15,792 INFO L85 PathProgramCache]: Analyzing trace with hash 558942549, now seen corresponding path program 1 times [2024-11-19 09:20:15,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:15,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089602801] [2024-11-19 09:20:15,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:15,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:16,160 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:16,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:16,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089602801] [2024-11-19 09:20:16,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089602801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:20:16,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247405010] [2024-11-19 09:20:16,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:16,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:20:16,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:20:16,163 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:20:16,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 09:20:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:16,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 1893 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:20:16,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:20:16,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:16,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:20:16,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:20:16,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247405010] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:20:16,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:20:16,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2024-11-19 09:20:16,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872631624] [2024-11-19 09:20:16,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:20:16,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 09:20:16,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:16,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 09:20:16,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:20:17,597 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 129 [2024-11-19 09:20:17,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 124 transitions, 579 flow. Second operand has 12 states, 12 states have (on average 78.75) internal successors, (945), 12 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:20:17,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:17,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 129 [2024-11-19 09:20:17,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:18,173 INFO L124 PetriNetUnfolderBase]: 1414/3333 cut-off events. [2024-11-19 09:20:18,173 INFO L125 PetriNetUnfolderBase]: For 2399/2399 co-relation queries the response was YES. [2024-11-19 09:20:18,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9107 conditions, 3333 events. 1414/3333 cut-off events. For 2399/2399 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 18953 event pairs, 175 based on Foata normal form. 100/3111 useless extension candidates. Maximal degree in co-relation 9080. Up to 784 conditions per place. [2024-11-19 09:20:18,193 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 122 selfloop transitions, 10 changer transitions 4/183 dead transitions. [2024-11-19 09:20:18,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 183 transitions, 1101 flow [2024-11-19 09:20:18,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:20:18,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:20:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 693 transitions. [2024-11-19 09:20:18,196 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6715116279069767 [2024-11-19 09:20:18,196 INFO L175 Difference]: Start difference. First operand has 130 places, 124 transitions, 579 flow. Second operand 8 states and 693 transitions. [2024-11-19 09:20:18,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 183 transitions, 1101 flow [2024-11-19 09:20:18,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 183 transitions, 1091 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-19 09:20:18,212 INFO L231 Difference]: Finished difference. Result has 134 places, 123 transitions, 585 flow [2024-11-19 09:20:18,212 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=585, PETRI_PLACES=134, PETRI_TRANSITIONS=123} [2024-11-19 09:20:18,213 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 12 predicate places. [2024-11-19 09:20:18,213 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 123 transitions, 585 flow [2024-11-19 09:20:18,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 78.75) internal successors, (945), 12 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:20:18,214 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:18,214 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:18,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 09:20:18,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 09:20:18,415 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-19 09:20:18,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:18,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1796658761, now seen corresponding path program 1 times [2024-11-19 09:20:18,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:18,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399446073] [2024-11-19 09:20:18,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:20:18,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:20:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 09:20:19,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:20:19,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399446073] [2024-11-19 09:20:19,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399446073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:20:19,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:20:19,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:20:19,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134186883] [2024-11-19 09:20:19,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:20:19,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:20:19,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:20:19,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:20:19,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:20:20,362 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 129 [2024-11-19 09:20:20,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 123 transitions, 585 flow. Second operand has 9 states, 9 states have (on average 71.33333333333333) internal successors, (642), 9 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:20:20,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:20:20,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 129 [2024-11-19 09:20:20,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:20:20,851 INFO L124 PetriNetUnfolderBase]: 1499/3288 cut-off events. [2024-11-19 09:20:20,851 INFO L125 PetriNetUnfolderBase]: For 1988/1988 co-relation queries the response was YES. [2024-11-19 09:20:20,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8989 conditions, 3288 events. 1499/3288 cut-off events. For 1988/1988 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 17678 event pairs, 188 based on Foata normal form. 0/2996 useless extension candidates. Maximal degree in co-relation 8961. Up to 2460 conditions per place. [2024-11-19 09:20:20,869 INFO L140 encePairwiseOnDemand]: 118/129 looper letters, 110 selfloop transitions, 12 changer transitions 4/160 dead transitions. [2024-11-19 09:20:20,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 160 transitions, 913 flow [2024-11-19 09:20:20,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:20:20,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:20:20,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 709 transitions. [2024-11-19 09:20:20,872 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6106804478897502 [2024-11-19 09:20:20,872 INFO L175 Difference]: Start difference. First operand has 134 places, 123 transitions, 585 flow. Second operand 9 states and 709 transitions. [2024-11-19 09:20:20,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 160 transitions, 913 flow [2024-11-19 09:20:20,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 160 transitions, 888 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-11-19 09:20:20,885 INFO L231 Difference]: Finished difference. Result has 137 places, 124 transitions, 590 flow [2024-11-19 09:20:20,885 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=590, PETRI_PLACES=137, PETRI_TRANSITIONS=124} [2024-11-19 09:20:20,885 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 15 predicate places. [2024-11-19 09:20:20,886 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 124 transitions, 590 flow [2024-11-19 09:20:20,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 71.33333333333333) internal successors, (642), 9 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:20:20,886 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:20:20,886 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:20:20,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 09:20:20,887 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-19 09:20:20,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:20:20,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1061413638, now seen corresponding path program 2 times [2024-11-19 09:20:20,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:20:20,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032912677] [2024-11-19 09:20:20,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:20:20,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:20:21,021 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:20:21,022 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat