./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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.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 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:20:54,103 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:20:54,178 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:20:54,182 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:20:54,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:20:54,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:20:54,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:20:54,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:20:54,206 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:20:54,207 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:20:54,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:20:54,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:20:54,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:20:54,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:20:54,209 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:20:54,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:20:54,209 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:20:54,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:20:54,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:20:54,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:20:54,211 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:20:54,211 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:20:54,212 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:20:54,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:20:54,215 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:20:54,215 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:20:54,216 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:20:54,216 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:20:54,216 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:20:54,217 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:20:54,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:20:54,217 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:20:54,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:20:54,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:20:54,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:20:54,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:20:54,218 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:20:54,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:20:54,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:20:54,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:20:54,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:20:54,221 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:20:54,221 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 -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2024-11-09 10:20:54,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:20:54,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:20:54,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:20:54,491 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:20:54,492 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:20:54,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_ok.i [2024-11-09 10:20:56,033 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:20:56,308 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:20:56,309 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok.i [2024-11-09 10:20:56,329 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dda130652/dbd0b3599ae1443a859c5252989d54ab/FLAGb5787eb07 [2024-11-09 10:20:56,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dda130652/dbd0b3599ae1443a859c5252989d54ab [2024-11-09 10:20:56,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:20:56,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:20:56,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:20:56,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:20:56,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:20:56,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:20:56" (1/1) ... [2024-11-09 10:20:56,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@236869c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:56, skipping insertion in model container [2024-11-09 10:20:56,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:20:56" (1/1) ... [2024-11-09 10:20:56,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:20:56,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:20:56,981 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:20:57,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:20:57,110 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:20:57,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:57 WrapperNode [2024-11-09 10:20:57,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:20:57,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:20:57,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:20:57,112 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:20:57,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:57" (1/1) ... [2024-11-09 10:20:57,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:57" (1/1) ... [2024-11-09 10:20:57,241 INFO L138 Inliner]: procedures = 274, calls = 94, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 241 [2024-11-09 10:20:57,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:20:57,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:20:57,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:20:57,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:20:57,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:57" (1/1) ... [2024-11-09 10:20:57,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:57" (1/1) ... [2024-11-09 10:20:57,288 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:57" (1/1) ... [2024-11-09 10:20:57,355 INFO L175 MemorySlicer]: Split 75 memory accesses to 4 slices as follows [2, 5, 22, 46]. 61 percent of accesses are in the largest equivalence class. The 50 initializations are split as follows [2, 5, 20, 23]. The 11 writes are split as follows [0, 0, 1, 10]. [2024-11-09 10:20:57,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:57" (1/1) ... [2024-11-09 10:20:57,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:57" (1/1) ... [2024-11-09 10:20:57,370 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:57" (1/1) ... [2024-11-09 10:20:57,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:57" (1/1) ... [2024-11-09 10:20:57,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:57" (1/1) ... [2024-11-09 10:20:57,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:57" (1/1) ... [2024-11-09 10:20:57,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:20:57,398 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:20:57,398 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:20:57,398 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:20:57,399 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:57" (1/1) ... [2024-11-09 10:20:57,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:20:57,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:20:57,445 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-09 10:20:57,449 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-09 10:20:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-09 10:20:57,488 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-09 10:20:57,488 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-09 10:20:57,488 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-09 10:20:57,489 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:20:57,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:20:57,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:20:57,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 10:20:57,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 10:20:57,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:20:57,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:20:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 10:20:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 10:20:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:20:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:20:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:20:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:20:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 10:20:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 10:20:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:20:57,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:20:57,497 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:20:57,639 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:20:57,641 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:20:58,150 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:20:58,150 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:20:58,548 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:20:58,549 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 10:20:58,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:20:58 BoogieIcfgContainer [2024-11-09 10:20:58,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:20:58,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:20:58,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:20:58,556 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:20:58,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:20:56" (1/3) ... [2024-11-09 10:20:58,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76041f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:20:58, skipping insertion in model container [2024-11-09 10:20:58,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:20:57" (2/3) ... [2024-11-09 10:20:58,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76041f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:20:58, skipping insertion in model container [2024-11-09 10:20:58,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:20:58" (3/3) ... [2024-11-09 10:20:58,560 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2024-11-09 10:20:58,578 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:20:58,578 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2024-11-09 10:20:58,578 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:20:58,692 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:20:58,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 129 transitions, 272 flow [2024-11-09 10:20:58,792 INFO L124 PetriNetUnfolderBase]: 11/127 cut-off events. [2024-11-09 10:20:58,794 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:20:58,799 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-09 10:20:58,799 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 129 transitions, 272 flow [2024-11-09 10:20:58,806 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 126 transitions, 264 flow [2024-11-09 10:20:58,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:20:58,831 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;@43938560, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:20:58,831 INFO L334 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2024-11-09 10:20:58,838 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:20:58,839 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2024-11-09 10:20:58,839 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:20:58,840 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:20:58,841 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-11-09 10:20:58,841 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-09 10:20:58,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:20:58,847 INFO L85 PathProgramCache]: Analyzing trace with hash 20809, now seen corresponding path program 1 times [2024-11-09 10:20:58,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:20:58,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466913851] [2024-11-09 10:20:58,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:20:58,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:20:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:20:59,228 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-09 10:20:59,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:20:59,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466913851] [2024-11-09 10:20:59,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466913851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:20:59,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:20:59,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:20:59,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289556894] [2024-11-09 10:20:59,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:20:59,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:20:59,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:20:59,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:20:59,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:20:59,390 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 129 [2024-11-09 10:20:59,393 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-09 10:20:59,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:20:59,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 129 [2024-11-09 10:20:59,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:20:59,905 INFO L124 PetriNetUnfolderBase]: 1089/2984 cut-off events. [2024-11-09 10:20:59,905 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-09 10:20:59,919 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-09 10:20:59,988 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 45 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2024-11-09 10:20:59,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 114 transitions, 334 flow [2024-11-09 10:20:59,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:20:59,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:21:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2024-11-09 10:21:00,006 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6873385012919897 [2024-11-09 10:21:00,008 INFO L175 Difference]: Start difference. First operand has 122 places, 126 transitions, 264 flow. Second operand 3 states and 266 transitions. [2024-11-09 10:21:00,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 114 transitions, 334 flow [2024-11-09 10:21:00,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 114 transitions, 326 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:21:00,018 INFO L231 Difference]: Finished difference. Result has 112 places, 114 transitions, 236 flow [2024-11-09 10:21:00,020 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-09 10:21:00,024 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -10 predicate places. [2024-11-09 10:21:00,025 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 114 transitions, 236 flow [2024-11-09 10:21:00,025 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-09 10:21:00,025 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:00,025 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-11-09 10:21:00,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:21:00,026 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-09 10:21:00,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:00,027 INFO L85 PathProgramCache]: Analyzing trace with hash 20810, now seen corresponding path program 1 times [2024-11-09 10:21:00,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:00,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468953160] [2024-11-09 10:21:00,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:00,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:00,177 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-09 10:21:00,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:00,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468953160] [2024-11-09 10:21:00,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468953160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:00,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:00,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:21:00,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914629170] [2024-11-09 10:21:00,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:00,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:21:00,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:00,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:21:00,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:21:00,270 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 129 [2024-11-09 10:21:00,271 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-09 10:21:00,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:00,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 129 [2024-11-09 10:21:00,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:00,613 INFO L124 PetriNetUnfolderBase]: 1089/2981 cut-off events. [2024-11-09 10:21:00,613 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-09 10:21:00,618 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-09 10:21:00,632 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 45 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2024-11-09 10:21:00,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 111 transitions, 324 flow [2024-11-09 10:21:00,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:21:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:21:00,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2024-11-09 10:21:00,635 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6795865633074936 [2024-11-09 10:21:00,635 INFO L175 Difference]: Start difference. First operand has 112 places, 114 transitions, 236 flow. Second operand 3 states and 263 transitions. [2024-11-09 10:21:00,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 111 transitions, 324 flow [2024-11-09 10:21:00,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 111 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:21:00,638 INFO L231 Difference]: Finished difference. Result has 109 places, 111 transitions, 230 flow [2024-11-09 10:21:00,639 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-09 10:21:00,639 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -13 predicate places. [2024-11-09 10:21:00,640 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 111 transitions, 230 flow [2024-11-09 10:21:00,640 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-09 10:21:00,640 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:00,640 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:21:00,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:21:00,641 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-09 10:21:00,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:00,641 INFO L85 PathProgramCache]: Analyzing trace with hash 620551874, now seen corresponding path program 1 times [2024-11-09 10:21:00,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:00,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882458800] [2024-11-09 10:21:00,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:00,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:00,733 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-09 10:21:00,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:00,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882458800] [2024-11-09 10:21:00,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882458800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:00,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:00,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:21:00,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705300845] [2024-11-09 10:21:00,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:00,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:21:00,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:00,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:21:00,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:21:00,811 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2024-11-09 10:21:00,812 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-09 10:21:00,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:00,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2024-11-09 10:21:00,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:01,172 INFO L124 PetriNetUnfolderBase]: 1089/2979 cut-off events. [2024-11-09 10:21:01,174 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-09 10:21:01,180 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-09 10:21:01,195 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 44 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2024-11-09 10:21:01,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 109 transitions, 320 flow [2024-11-09 10:21:01,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:21:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:21:01,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2024-11-09 10:21:01,200 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6531007751937985 [2024-11-09 10:21:01,200 INFO L175 Difference]: Start difference. First operand has 109 places, 111 transitions, 230 flow. Second operand 4 states and 337 transitions. [2024-11-09 10:21:01,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 109 transitions, 320 flow [2024-11-09 10:21:01,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 109 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:21:01,203 INFO L231 Difference]: Finished difference. Result has 108 places, 109 transitions, 228 flow [2024-11-09 10:21:01,204 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-09 10:21:01,205 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -14 predicate places. [2024-11-09 10:21:01,205 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 109 transitions, 228 flow [2024-11-09 10:21:01,205 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-09 10:21:01,205 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:01,206 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:21:01,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:21:01,206 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-09 10:21:01,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:01,207 INFO L85 PathProgramCache]: Analyzing trace with hash 620551875, now seen corresponding path program 1 times [2024-11-09 10:21:01,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:01,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878544783] [2024-11-09 10:21:01,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:01,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:21:01,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:01,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878544783] [2024-11-09 10:21:01,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878544783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:01,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:01,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:21:01,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58430673] [2024-11-09 10:21:01,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:01,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:21:01,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:01,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:21:01,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:21:01,705 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 129 [2024-11-09 10:21:01,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 109 transitions, 228 flow. Second operand has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 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-09 10:21:01,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:01,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 129 [2024-11-09 10:21:01,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:02,064 INFO L124 PetriNetUnfolderBase]: 1089/2977 cut-off events. [2024-11-09 10:21:02,064 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-09 10:21:02,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4688 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 23584 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-09 10:21:02,082 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 45 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2024-11-09 10:21:02,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 107 transitions, 320 flow [2024-11-09 10:21:02,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:21:02,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:21:02,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 334 transitions. [2024-11-09 10:21:02,085 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6472868217054264 [2024-11-09 10:21:02,085 INFO L175 Difference]: Start difference. First operand has 108 places, 109 transitions, 228 flow. Second operand 4 states and 334 transitions. [2024-11-09 10:21:02,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 107 transitions, 320 flow [2024-11-09 10:21:02,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 107 transitions, 314 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:21:02,088 INFO L231 Difference]: Finished difference. Result has 106 places, 107 transitions, 224 flow [2024-11-09 10:21:02,088 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-09 10:21:02,089 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -16 predicate places. [2024-11-09 10:21:02,089 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 107 transitions, 224 flow [2024-11-09 10:21:02,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.8) internal successors, (359), 5 states have internal predecessors, (359), 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-09 10:21:02,090 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:02,090 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:21:02,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:21:02,090 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-09 10:21:02,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:02,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1863706484, now seen corresponding path program 1 times [2024-11-09 10:21:02,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:02,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109941743] [2024-11-09 10:21:02,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:02,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:02,211 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-09 10:21:02,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:02,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109941743] [2024-11-09 10:21:02,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109941743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:02,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:02,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:21:02,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804449513] [2024-11-09 10:21:02,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:02,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:21:02,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:02,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:21:02,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:21:02,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 129 [2024-11-09 10:21:02,355 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-09 10:21:02,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:02,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 129 [2024-11-09 10:21:02,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:02,651 INFO L124 PetriNetUnfolderBase]: 1046/2622 cut-off events. [2024-11-09 10:21:02,651 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-09 10:21:02,656 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-09 10:21:02,674 INFO L140 encePairwiseOnDemand]: 118/129 looper letters, 67 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2024-11-09 10:21:02,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 122 transitions, 395 flow [2024-11-09 10:21:02,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:21:02,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:21:02,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 342 transitions. [2024-11-09 10:21:02,676 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6627906976744186 [2024-11-09 10:21:02,676 INFO L175 Difference]: Start difference. First operand has 106 places, 107 transitions, 224 flow. Second operand 4 states and 342 transitions. [2024-11-09 10:21:02,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 122 transitions, 395 flow [2024-11-09 10:21:02,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 122 transitions, 389 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:21:02,680 INFO L231 Difference]: Finished difference. Result has 98 places, 99 transitions, 208 flow [2024-11-09 10:21:02,680 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-09 10:21:02,683 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2024-11-09 10:21:02,683 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 99 transitions, 208 flow [2024-11-09 10:21:02,684 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-09 10:21:02,684 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:02,687 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:21:02,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:21:02,687 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-09 10:21:02,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:02,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1863706483, now seen corresponding path program 1 times [2024-11-09 10:21:02,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:02,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534910241] [2024-11-09 10:21:02,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:02,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:03,018 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-09 10:21:03,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:03,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534910241] [2024-11-09 10:21:03,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534910241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:03,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:03,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:21:03,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913271501] [2024-11-09 10:21:03,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:03,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:21:03,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:03,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:21:03,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:21:03,244 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 129 [2024-11-09 10:21:03,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 99 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 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-09 10:21:03,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:03,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 129 [2024-11-09 10:21:03,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:03,600 INFO L124 PetriNetUnfolderBase]: 1046/2354 cut-off events. [2024-11-09 10:21:03,601 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2024-11-09 10:21:03,605 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 15825 event pairs, 426 based on Foata normal form. 120/2000 useless extension candidates. Maximal degree in co-relation 1953. Up to 881 conditions per place. [2024-11-09 10:21:03,617 INFO L140 encePairwiseOnDemand]: 118/129 looper letters, 66 selfloop transitions, 4 changer transitions 0/115 dead transitions. [2024-11-09 10:21:03,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 115 transitions, 381 flow [2024-11-09 10:21:03,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:21:03,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:21:03,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 412 transitions. [2024-11-09 10:21:03,620 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6387596899224807 [2024-11-09 10:21:03,620 INFO L175 Difference]: Start difference. First operand has 98 places, 99 transitions, 208 flow. Second operand 5 states and 412 transitions. [2024-11-09 10:21:03,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 115 transitions, 381 flow [2024-11-09 10:21:03,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 115 transitions, 375 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:21:03,624 INFO L231 Difference]: Finished difference. Result has 92 places, 92 transitions, 196 flow [2024-11-09 10:21:03,625 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=92, PETRI_TRANSITIONS=92} [2024-11-09 10:21:03,626 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -30 predicate places. [2024-11-09 10:21:03,627 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 92 transitions, 196 flow [2024-11-09 10:21:03,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 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-09 10:21:03,628 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:03,628 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:21:03,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:21:03,628 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-09 10:21:03,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:03,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1940325448, now seen corresponding path program 1 times [2024-11-09 10:21:03,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:03,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757551092] [2024-11-09 10:21:03,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:03,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:04,147 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-09 10:21:04,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:04,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757551092] [2024-11-09 10:21:04,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757551092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:04,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:04,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:21:04,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835766178] [2024-11-09 10:21:04,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:04,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:21:04,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:04,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:21:04,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:21:04,563 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 129 [2024-11-09 10:21:04,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 92 transitions, 196 flow. Second operand has 7 states, 7 states have (on average 59.857142857142854) internal successors, (419), 7 states have internal predecessors, (419), 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-09 10:21:04,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:04,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 129 [2024-11-09 10:21:04,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:05,203 INFO L124 PetriNetUnfolderBase]: 2065/4255 cut-off events. [2024-11-09 10:21:05,204 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-11-09 10:21:05,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7680 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 29594 event pairs, 289 based on Foata normal form. 0/3449 useless extension candidates. Maximal degree in co-relation 2479. Up to 2157 conditions per place. [2024-11-09 10:21:05,229 INFO L140 encePairwiseOnDemand]: 120/129 looper letters, 132 selfloop transitions, 11 changer transitions 0/182 dead transitions. [2024-11-09 10:21:05,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 182 transitions, 669 flow [2024-11-09 10:21:05,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:21:05,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:21:05,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 551 transitions. [2024-11-09 10:21:05,232 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6101882613510521 [2024-11-09 10:21:05,232 INFO L175 Difference]: Start difference. First operand has 92 places, 92 transitions, 196 flow. Second operand 7 states and 551 transitions. [2024-11-09 10:21:05,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 182 transitions, 669 flow [2024-11-09 10:21:05,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 182 transitions, 659 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:21:05,239 INFO L231 Difference]: Finished difference. Result has 98 places, 102 transitions, 262 flow [2024-11-09 10:21:05,240 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=98, PETRI_TRANSITIONS=102} [2024-11-09 10:21:05,240 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2024-11-09 10:21:05,241 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 102 transitions, 262 flow [2024-11-09 10:21:05,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.857142857142854) internal successors, (419), 7 states have internal predecessors, (419), 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-09 10:21:05,241 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:05,241 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:21:05,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:21:05,242 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-09 10:21:05,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:05,242 INFO L85 PathProgramCache]: Analyzing trace with hash -678346437, now seen corresponding path program 1 times [2024-11-09 10:21:05,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:05,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826648887] [2024-11-09 10:21:05,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:05,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:05,341 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-09 10:21:05,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:05,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826648887] [2024-11-09 10:21:05,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826648887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:05,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:05,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:21:05,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782968110] [2024-11-09 10:21:05,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:05,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:21:05,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:05,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:21:05,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:21:05,350 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2024-11-09 10:21:05,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 102 transitions, 262 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-09 10:21:05,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:05,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2024-11-09 10:21:05,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:05,536 INFO L124 PetriNetUnfolderBase]: 692/1652 cut-off events. [2024-11-09 10:21:05,537 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-11-09 10:21:05,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3114 conditions, 1652 events. 692/1652 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 10251 event pairs, 446 based on Foata normal form. 43/1432 useless extension candidates. Maximal degree in co-relation 3071. Up to 693 conditions per place. [2024-11-09 10:21:05,545 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 59 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2024-11-09 10:21:05,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 109 transitions, 391 flow [2024-11-09 10:21:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:21:05,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:21:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2024-11-09 10:21:05,547 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7260981912144703 [2024-11-09 10:21:05,547 INFO L175 Difference]: Start difference. First operand has 98 places, 102 transitions, 262 flow. Second operand 3 states and 281 transitions. [2024-11-09 10:21:05,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 109 transitions, 391 flow [2024-11-09 10:21:05,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 109 transitions, 387 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 10:21:05,553 INFO L231 Difference]: Finished difference. Result has 98 places, 98 transitions, 249 flow [2024-11-09 10:21:05,553 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-09 10:21:05,555 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2024-11-09 10:21:05,556 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 98 transitions, 249 flow [2024-11-09 10:21:05,556 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-09 10:21:05,556 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:05,556 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-09 10:21:05,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:21:05,560 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-09 10:21:05,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:05,561 INFO L85 PathProgramCache]: Analyzing trace with hash 155541361, now seen corresponding path program 1 times [2024-11-09 10:21:05,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:05,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043946554] [2024-11-09 10:21:05,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:05,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:05,607 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-09 10:21:05,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:05,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043946554] [2024-11-09 10:21:05,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043946554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:05,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:05,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:21:05,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752338998] [2024-11-09 10:21:05,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:05,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:21:05,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:05,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:21:05,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:21:05,612 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2024-11-09 10:21:05,612 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-09 10:21:05,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:05,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2024-11-09 10:21:05,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:05,805 INFO L124 PetriNetUnfolderBase]: 572/1382 cut-off events. [2024-11-09 10:21:05,805 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-11-09 10:21:05,808 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 7608 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-09 10:21:05,812 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 62 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2024-11-09 10:21:05,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 111 transitions, 401 flow [2024-11-09 10:21:05,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:21:05,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:21:05,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2024-11-09 10:21:05,813 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7416020671834626 [2024-11-09 10:21:05,814 INFO L175 Difference]: Start difference. First operand has 98 places, 98 transitions, 249 flow. Second operand 3 states and 287 transitions. [2024-11-09 10:21:05,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 111 transitions, 401 flow [2024-11-09 10:21:05,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 111 transitions, 393 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 10:21:05,817 INFO L231 Difference]: Finished difference. Result has 99 places, 98 transitions, 248 flow [2024-11-09 10:21:05,817 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-09 10:21:05,818 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -23 predicate places. [2024-11-09 10:21:05,818 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 98 transitions, 248 flow [2024-11-09 10:21:05,818 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-09 10:21:05,818 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:05,819 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-09 10:21:05,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:21:05,819 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-09 10:21:05,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:05,819 INFO L85 PathProgramCache]: Analyzing trace with hash -451660651, now seen corresponding path program 1 times [2024-11-09 10:21:05,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:05,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081869849] [2024-11-09 10:21:05,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:05,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:05,893 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-09 10:21:05,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:05,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081869849] [2024-11-09 10:21:05,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081869849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:05,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:05,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:21:05,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734344235] [2024-11-09 10:21:05,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:05,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:21:05,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:05,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:21:05,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:21:05,958 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2024-11-09 10:21:05,959 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-09 10:21:05,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:05,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2024-11-09 10:21:05,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:06,113 INFO L124 PetriNetUnfolderBase]: 572/1349 cut-off events. [2024-11-09 10:21:06,113 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2024-11-09 10:21:06,116 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 7266 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-09 10:21:06,120 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 50 selfloop transitions, 1 changer transitions 0/96 dead transitions. [2024-11-09 10:21:06,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 96 transitions, 346 flow [2024-11-09 10:21:06,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:21:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:21:06,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2024-11-09 10:21:06,121 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6847545219638242 [2024-11-09 10:21:06,121 INFO L175 Difference]: Start difference. First operand has 99 places, 98 transitions, 248 flow. Second operand 3 states and 265 transitions. [2024-11-09 10:21:06,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 96 transitions, 346 flow [2024-11-09 10:21:06,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 96 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:21:06,124 INFO L231 Difference]: Finished difference. Result has 98 places, 96 transitions, 244 flow [2024-11-09 10:21:06,124 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-09 10:21:06,125 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2024-11-09 10:21:06,125 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 96 transitions, 244 flow [2024-11-09 10:21:06,125 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-09 10:21:06,126 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:06,126 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-09 10:21:06,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:21:06,126 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-09 10:21:06,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:06,127 INFO L85 PathProgramCache]: Analyzing trace with hash -451660650, now seen corresponding path program 1 times [2024-11-09 10:21:06,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:06,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756277487] [2024-11-09 10:21:06,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:06,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:06,301 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-09 10:21:06,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:06,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756277487] [2024-11-09 10:21:06,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756277487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:21:06,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:21:06,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:21:06,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931490068] [2024-11-09 10:21:06,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:21:06,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:21:06,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:06,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:21:06,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:21:06,420 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 129 [2024-11-09 10:21:06,421 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-09 10:21:06,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:06,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 129 [2024-11-09 10:21:06,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:06,629 INFO L124 PetriNetUnfolderBase]: 587/1354 cut-off events. [2024-11-09 10:21:06,630 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-11-09 10:21:06,633 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 7174 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-09 10:21:06,637 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 62 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2024-11-09 10:21:06,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 109 transitions, 401 flow [2024-11-09 10:21:06,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:21:06,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:21:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 358 transitions. [2024-11-09 10:21:06,639 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6937984496124031 [2024-11-09 10:21:06,639 INFO L175 Difference]: Start difference. First operand has 98 places, 96 transitions, 244 flow. Second operand 4 states and 358 transitions. [2024-11-09 10:21:06,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 109 transitions, 401 flow [2024-11-09 10:21:06,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 109 transitions, 400 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:21:06,642 INFO L231 Difference]: Finished difference. Result has 101 places, 96 transitions, 253 flow [2024-11-09 10:21:06,643 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-09 10:21:06,643 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -21 predicate places. [2024-11-09 10:21:06,643 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 96 transitions, 253 flow [2024-11-09 10:21:06,644 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-09 10:21:06,644 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:06,644 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-09 10:21:06,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:21:06,644 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-09 10:21:06,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:06,645 INFO L85 PathProgramCache]: Analyzing trace with hash 710870985, now seen corresponding path program 1 times [2024-11-09 10:21:06,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:06,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685992150] [2024-11-09 10:21:06,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:06,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:07,110 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-09 10:21:07,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:07,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685992150] [2024-11-09 10:21:07,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685992150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:21:07,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716415022] [2024-11-09 10:21:07,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:07,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:21:07,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:21:07,113 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-09 10:21:07,115 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-09 10:21:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:07,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 10:21:07,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:21:07,531 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-09 10:21:07,626 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-09 10:21:07,626 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:21:07,731 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 36 treesize of output 30 [2024-11-09 10:21:07,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:21:07,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:21:07,886 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-09 10:21:07,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716415022] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:21:07,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:21:07,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2024-11-09 10:21:07,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106426985] [2024-11-09 10:21:07,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:21:07,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 10:21:07,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:21:07,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 10:21:07,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-09 10:21:09,474 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 129 [2024-11-09 10:21:09,476 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-09 10:21:09,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:21:09,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 129 [2024-11-09 10:21:09,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:21:10,237 INFO L124 PetriNetUnfolderBase]: 1005/2167 cut-off events. [2024-11-09 10:21:10,237 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2024-11-09 10:21:10,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4471 conditions, 2167 events. 1005/2167 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 12914 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-09 10:21:10,251 INFO L140 encePairwiseOnDemand]: 120/129 looper letters, 127 selfloop transitions, 14 changer transitions 0/177 dead transitions. [2024-11-09 10:21:10,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 177 transitions, 731 flow [2024-11-09 10:21:10,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:21:10,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:21:10,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 738 transitions. [2024-11-09 10:21:10,255 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5720930232558139 [2024-11-09 10:21:10,255 INFO L175 Difference]: Start difference. First operand has 101 places, 96 transitions, 253 flow. Second operand 10 states and 738 transitions. [2024-11-09 10:21:10,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 177 transitions, 731 flow [2024-11-09 10:21:10,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 177 transitions, 723 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:21:10,260 INFO L231 Difference]: Finished difference. Result has 111 places, 103 transitions, 329 flow [2024-11-09 10:21:10,261 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-09 10:21:10,261 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -11 predicate places. [2024-11-09 10:21:10,261 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 103 transitions, 329 flow [2024-11-09 10:21:10,262 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-09 10:21:10,262 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:21:10,262 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-09 10:21:10,280 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-09 10:21:10,463 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-09 10:21:10,463 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-09 10:21:10,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:21:10,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1766144426, now seen corresponding path program 1 times [2024-11-09 10:21:10,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:21:10,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224619648] [2024-11-09 10:21:10,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:10,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:21:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:11,532 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-09 10:21:11,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:21:11,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224619648] [2024-11-09 10:21:11,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224619648] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:21:11,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062009021] [2024-11-09 10:21:11,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:21:11,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:21:11,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:21:11,535 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-09 10:21:11,537 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-09 10:21:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:21:11,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-09 10:21:11,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:21:11,720 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-09 10:21:11,760 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 23 treesize of output 11 [2024-11-09 10:21:11,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:21:11,945 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 27 treesize of output 11 [2024-11-09 10:21:11,983 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 23 treesize of output 11 [2024-11-09 10:21:12,065 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-09 10:21:12,147 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-09 10:21:12,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:22:12,291 INFO L349 Elim1Store]: treesize reduction 47, result has 52.5 percent of original size [2024-11-09 10:22:12,292 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 212 treesize of output 236 [2024-11-09 10:22:12,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:22:12,355 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 85 treesize of output 85 [2024-11-09 10:22:12,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 42 treesize of output 34 [2024-11-09 10:22:12,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:22:12,576 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 110 treesize of output 112 [2024-11-09 10:22:12,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:22:12,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:22:12,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:22:12,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 45 [2024-11-09 10:22:13,008 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 32 treesize of output 28 [2024-11-09 10:22:13,015 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:22:13,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:22:13,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 13 [2024-11-09 10:22:13,248 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-09 10:22:13,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062009021] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:22:13,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:22:13,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 29 [2024-11-09 10:22:13,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885738763] [2024-11-09 10:22:13,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:22:13,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 10:22:13,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:13,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 10:22:13,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=771, Unknown=13, NotChecked=0, Total=930 [2024-11-09 10:22:17,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 10:22:21,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 10:22:23,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 10:22:27,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]