./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 4e91816f101a416d37c086dd7185cfb4e2bfa63eb286e4a418cb94db27cf2f6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:58:13,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:58:13,393 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:58:13,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:58:13,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:58:13,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:58:13,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:58:13,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:58:13,411 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:58:13,411 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:58:13,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:58:13,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:58:13,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:58:13,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:58:13,412 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:58:13,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:58:13,412 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:58:13,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:58:13,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:58:13,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:58:13,413 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:58:13,413 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:58:13,413 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:58:13,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:58:13,413 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:58:13,413 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:58:13,413 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:58:13,413 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:58:13,413 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:58:13,413 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:58:13,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:58:13,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:58:13,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:58:13,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:58:13,413 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:58:13,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:58:13,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:58:13,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:58:13,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:58:13,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:58:13,414 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:58:13,414 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:58:13,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:58:13,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:58:13,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:58:13,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:58:13,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:58:13,414 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 4e91816f101a416d37c086dd7185cfb4e2bfa63eb286e4a418cb94db27cf2f6f [2025-01-10 00:58:13,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:58:13,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:58:13,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:58:13,657 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:58:13,657 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:58:13,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i [2025-01-10 00:58:14,939 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/836d1c060/757456a6f3af402db13b4ef6228954bc/FLAGb374500fa [2025-01-10 00:58:15,243 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:58:15,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i [2025-01-10 00:58:15,256 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/836d1c060/757456a6f3af402db13b4ef6228954bc/FLAGb374500fa [2025-01-10 00:58:15,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/836d1c060/757456a6f3af402db13b4ef6228954bc [2025-01-10 00:58:15,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:58:15,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:58:15,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:58:15,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:58:15,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:58:15,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:58:15" (1/1) ... [2025-01-10 00:58:15,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f34c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:15, skipping insertion in model container [2025-01-10 00:58:15,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:58:15" (1/1) ... [2025-01-10 00:58:15,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:58:15,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:58:15,724 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:58:15,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:58:15,799 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:58:15,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:15 WrapperNode [2025-01-10 00:58:15,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:58:15,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:58:15,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:58:15,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:58:15,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:15" (1/1) ... [2025-01-10 00:58:15,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:15" (1/1) ... [2025-01-10 00:58:15,839 INFO L138 Inliner]: procedures = 174, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 184 [2025-01-10 00:58:15,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:58:15,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:58:15,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:58:15,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:58:15,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:15" (1/1) ... [2025-01-10 00:58:15,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:15" (1/1) ... [2025-01-10 00:58:15,852 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:15" (1/1) ... [2025-01-10 00:58:15,873 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 2, 5, 5]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 5, 5]. The 1 writes are split as follows [0, 1, 0, 0]. [2025-01-10 00:58:15,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:15" (1/1) ... [2025-01-10 00:58:15,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:15" (1/1) ... [2025-01-10 00:58:15,879 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:15" (1/1) ... [2025-01-10 00:58:15,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:15" (1/1) ... [2025-01-10 00:58:15,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:15" (1/1) ... [2025-01-10 00:58:15,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:15" (1/1) ... [2025-01-10 00:58:15,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:15" (1/1) ... [2025-01-10 00:58:15,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:58:15,894 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:58:15,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:58:15,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:58:15,896 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:15" (1/1) ... [2025-01-10 00:58:15,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:58:15,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:58:15,929 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:58:15,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:58:15,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:58:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:58:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:58:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 00:58:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:58:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:58:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:58:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 00:58:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:58:15,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:58:15,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:58:15,955 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 00:58:15,955 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 00:58:15,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:58:15,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:58:15,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:58:15,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:58:15,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 00:58:15,955 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:58:15,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:58:15,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:58:15,957 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:58:16,127 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:58:16,132 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:58:16,381 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:58:16,382 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:58:16,700 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:58:16,700 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 00:58:16,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:58:16 BoogieIcfgContainer [2025-01-10 00:58:16,701 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:58:16,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:58:16,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:58:16,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:58:16,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:58:15" (1/3) ... [2025-01-10 00:58:16,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac25339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:58:16, skipping insertion in model container [2025-01-10 00:58:16,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:15" (2/3) ... [2025-01-10 00:58:16,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac25339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:58:16, skipping insertion in model container [2025-01-10 00:58:16,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:58:16" (3/3) ... [2025-01-10 00:58:16,709 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_20-callback_racefree.i [2025-01-10 00:58:16,720 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:58:16,721 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_20-callback_racefree.i that has 2 procedures, 52 locations, 1 initial locations, 7 loop locations, and 6 error locations. [2025-01-10 00:58:16,722 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:58:16,769 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 00:58:16,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 65 transitions, 137 flow [2025-01-10 00:58:16,836 INFO L124 PetriNetUnfolderBase]: 21/104 cut-off events. [2025-01-10 00:58:16,838 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:58:16,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 104 events. 21/104 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 382 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 60. Up to 6 conditions per place. [2025-01-10 00:58:16,841 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 65 transitions, 137 flow [2025-01-10 00:58:16,844 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 65 transitions, 137 flow [2025-01-10 00:58:16,850 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:58:16,859 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;@690fb020, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:58:16,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 00:58:16,864 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:58:16,864 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:58:16,864 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:58:16,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:16,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:58:16,865 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-01-10 00:58:16,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:16,869 INFO L85 PathProgramCache]: Analyzing trace with hash 503221, now seen corresponding path program 1 times [2025-01-10 00:58:16,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:16,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126840432] [2025-01-10 00:58:16,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:16,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:17,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:58:17,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:58:17,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:17,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:17,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:17,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:17,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126840432] [2025-01-10 00:58:17,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126840432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:17,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:17,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:17,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20434868] [2025-01-10 00:58:17,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:17,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:17,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:17,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:17,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:17,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 65 [2025-01-10 00:58:17,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 65 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2025-01-10 00:58:17,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:17,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 65 [2025-01-10 00:58:17,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:17,314 INFO L124 PetriNetUnfolderBase]: 173/517 cut-off events. [2025-01-10 00:58:17,314 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:58:17,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 517 events. 173/517 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2790 event pairs, 136 based on Foata normal form. 97/576 useless extension candidates. Maximal degree in co-relation 828. Up to 337 conditions per place. [2025-01-10 00:58:17,318 INFO L140 encePairwiseOnDemand]: 51/65 looper letters, 39 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2025-01-10 00:58:17,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 60 transitions, 209 flow [2025-01-10 00:58:17,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:17,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2025-01-10 00:58:17,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5846153846153846 [2025-01-10 00:58:17,332 INFO L175 Difference]: Start difference. First operand has 55 places, 65 transitions, 137 flow. Second operand 3 states and 114 transitions. [2025-01-10 00:58:17,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 60 transitions, 209 flow [2025-01-10 00:58:17,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 209 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:58:17,340 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 115 flow [2025-01-10 00:58:17,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2025-01-10 00:58:17,350 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, -1 predicate places. [2025-01-10 00:58:17,351 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 115 flow [2025-01-10 00:58:17,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2025-01-10 00:58:17,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:17,351 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:58:17,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:58:17,351 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-01-10 00:58:17,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:17,351 INFO L85 PathProgramCache]: Analyzing trace with hash 503222, now seen corresponding path program 1 times [2025-01-10 00:58:17,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:17,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296748397] [2025-01-10 00:58:17,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:17,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:17,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:58:17,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:58:17,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:17,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:17,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:17,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:17,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296748397] [2025-01-10 00:58:17,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296748397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:17,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:17,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:17,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630886712] [2025-01-10 00:58:17,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:17,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:17,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:17,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:17,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:17,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 65 [2025-01-10 00:58:17,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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) [2025-01-10 00:58:17,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:17,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 65 [2025-01-10 00:58:17,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:17,685 INFO L124 PetriNetUnfolderBase]: 162/477 cut-off events. [2025-01-10 00:58:17,686 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-10 00:58:17,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 477 events. 162/477 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2420 event pairs, 136 based on Foata normal form. 1/439 useless extension candidates. Maximal degree in co-relation 805. Up to 329 conditions per place. [2025-01-10 00:58:17,689 INFO L140 encePairwiseOnDemand]: 61/65 looper letters, 39 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2025-01-10 00:58:17,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 215 flow [2025-01-10 00:58:17,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:17,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:17,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-01-10 00:58:17,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.558974358974359 [2025-01-10 00:58:17,690 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 115 flow. Second operand 3 states and 109 transitions. [2025-01-10 00:58:17,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 215 flow [2025-01-10 00:58:17,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 211 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:58:17,693 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 121 flow [2025-01-10 00:58:17,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2025-01-10 00:58:17,694 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2025-01-10 00:58:17,694 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 121 flow [2025-01-10 00:58:17,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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) [2025-01-10 00:58:17,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:17,694 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 00:58:17,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:58:17,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-01-10 00:58:17,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:17,695 INFO L85 PathProgramCache]: Analyzing trace with hash 894110154, now seen corresponding path program 1 times [2025-01-10 00:58:17,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:17,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30371360] [2025-01-10 00:58:17,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:17,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:17,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:58:17,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:58:17,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:17,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:17,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:17,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:17,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30371360] [2025-01-10 00:58:17,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30371360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:17,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:17,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:58:17,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433530403] [2025-01-10 00:58:17,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:17,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:58:17,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:17,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:58:17,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:58:17,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 65 [2025-01-10 00:58:17,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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) [2025-01-10 00:58:17,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:17,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 65 [2025-01-10 00:58:17,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:17,984 INFO L124 PetriNetUnfolderBase]: 154/435 cut-off events. [2025-01-10 00:58:17,985 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-10 00:58:17,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 435 events. 154/435 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2221 event pairs, 28 based on Foata normal form. 9/417 useless extension candidates. Maximal degree in co-relation 756. Up to 278 conditions per place. [2025-01-10 00:58:17,989 INFO L140 encePairwiseOnDemand]: 61/65 looper letters, 45 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2025-01-10 00:58:17,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 247 flow [2025-01-10 00:58:17,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:58:17,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:58:17,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2025-01-10 00:58:17,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5269230769230769 [2025-01-10 00:58:17,992 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 121 flow. Second operand 4 states and 137 transitions. [2025-01-10 00:58:17,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 247 flow [2025-01-10 00:58:17,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:58:17,994 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 119 flow [2025-01-10 00:58:17,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2025-01-10 00:58:17,995 INFO L279 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2025-01-10 00:58:17,995 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 119 flow [2025-01-10 00:58:17,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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) [2025-01-10 00:58:17,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:17,996 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 00:58:17,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:58:17,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-01-10 00:58:17,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:17,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1947611468, now seen corresponding path program 1 times [2025-01-10 00:58:17,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:17,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295180139] [2025-01-10 00:58:17,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:17,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:18,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:58:18,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:58:18,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:18,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:58:18,023 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:58:18,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:58:18,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:58:18,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:18,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:58:18,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:58:18,049 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:58:18,049 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-01-10 00:58:18,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 8 remaining) [2025-01-10 00:58:18,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2025-01-10 00:58:18,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 8 remaining) [2025-01-10 00:58:18,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 8 remaining) [2025-01-10 00:58:18,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2025-01-10 00:58:18,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2025-01-10 00:58:18,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-01-10 00:58:18,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:58:18,052 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-10 00:58:18,053 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:58:18,054 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:58:18,071 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 00:58:18,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 87 transitions, 190 flow [2025-01-10 00:58:18,086 INFO L124 PetriNetUnfolderBase]: 35/177 cut-off events. [2025-01-10 00:58:18,086 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-01-10 00:58:18,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 177 events. 35/177 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 750 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 108. Up to 9 conditions per place. [2025-01-10 00:58:18,087 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 87 transitions, 190 flow [2025-01-10 00:58:18,088 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 87 transitions, 190 flow [2025-01-10 00:58:18,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:58:18,089 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;@690fb020, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:58:18,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-01-10 00:58:18,092 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:58:18,092 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:58:18,092 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:58:18,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:18,092 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:58:18,092 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-10 00:58:18,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:18,092 INFO L85 PathProgramCache]: Analyzing trace with hash 589612, now seen corresponding path program 1 times [2025-01-10 00:58:18,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:18,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457033170] [2025-01-10 00:58:18,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:18,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:18,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:58:18,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:58:18,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:18,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:18,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:18,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457033170] [2025-01-10 00:58:18,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457033170] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:18,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:18,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:18,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501218799] [2025-01-10 00:58:18,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:18,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:18,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:18,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:18,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:18,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 87 [2025-01-10 00:58:18,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 87 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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) [2025-01-10 00:58:18,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:18,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 87 [2025-01-10 00:58:18,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:18,746 INFO L124 PetriNetUnfolderBase]: 3201/6416 cut-off events. [2025-01-10 00:58:18,746 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-01-10 00:58:18,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11544 conditions, 6416 events. 3201/6416 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 49862 event pairs, 2688 based on Foata normal form. 1446/7475 useless extension candidates. Maximal degree in co-relation 8154. Up to 4555 conditions per place. [2025-01-10 00:58:18,779 INFO L140 encePairwiseOnDemand]: 69/87 looper letters, 57 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2025-01-10 00:58:18,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 85 transitions, 304 flow [2025-01-10 00:58:18,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2025-01-10 00:58:18,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6168582375478927 [2025-01-10 00:58:18,781 INFO L175 Difference]: Start difference. First operand has 74 places, 87 transitions, 190 flow. Second operand 3 states and 161 transitions. [2025-01-10 00:58:18,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 85 transitions, 304 flow [2025-01-10 00:58:18,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 85 transitions, 304 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:58:18,783 INFO L231 Difference]: Finished difference. Result has 72 places, 69 transitions, 158 flow [2025-01-10 00:58:18,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=72, PETRI_TRANSITIONS=69} [2025-01-10 00:58:18,783 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, -2 predicate places. [2025-01-10 00:58:18,783 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 158 flow [2025-01-10 00:58:18,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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) [2025-01-10 00:58:18,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:18,784 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:58:18,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:58:18,784 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-10 00:58:18,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:18,784 INFO L85 PathProgramCache]: Analyzing trace with hash 589613, now seen corresponding path program 1 times [2025-01-10 00:58:18,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:18,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359614919] [2025-01-10 00:58:18,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:18,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:18,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:58:18,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:58:18,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:18,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:18,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:18,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359614919] [2025-01-10 00:58:18,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359614919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:18,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:18,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:18,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569386728] [2025-01-10 00:58:18,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:18,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:18,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:18,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:18,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:18,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 87 [2025-01-10 00:58:18,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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) [2025-01-10 00:58:18,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:18,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 87 [2025-01-10 00:58:18,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:19,451 INFO L124 PetriNetUnfolderBase]: 3038/6166 cut-off events. [2025-01-10 00:58:19,451 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2025-01-10 00:58:19,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11120 conditions, 6166 events. 3038/6166 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 47414 event pairs, 2840 based on Foata normal form. 1/5752 useless extension candidates. Maximal degree in co-relation 10169. Up to 4789 conditions per place. [2025-01-10 00:58:19,483 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 50 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2025-01-10 00:58:19,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 79 transitions, 282 flow [2025-01-10 00:58:19,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:19,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:19,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2025-01-10 00:58:19,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5402298850574713 [2025-01-10 00:58:19,485 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 158 flow. Second operand 3 states and 141 transitions. [2025-01-10 00:58:19,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 79 transitions, 282 flow [2025-01-10 00:58:19,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 79 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:58:19,488 INFO L231 Difference]: Finished difference. Result has 73 places, 70 transitions, 168 flow [2025-01-10 00:58:19,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=73, PETRI_TRANSITIONS=70} [2025-01-10 00:58:19,489 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, -1 predicate places. [2025-01-10 00:58:19,489 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 70 transitions, 168 flow [2025-01-10 00:58:19,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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) [2025-01-10 00:58:19,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:19,489 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 00:58:19,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:58:19,490 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-10 00:58:19,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:19,490 INFO L85 PathProgramCache]: Analyzing trace with hash -923091731, now seen corresponding path program 1 times [2025-01-10 00:58:19,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:19,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234377023] [2025-01-10 00:58:19,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:19,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:19,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:58:19,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:58:19,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:19,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:19,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:19,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:19,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234377023] [2025-01-10 00:58:19,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234377023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:19,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:19,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:58:19,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811733482] [2025-01-10 00:58:19,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:19,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:58:19,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:19,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:58:19,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:58:19,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-01-10 00:58:19,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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) [2025-01-10 00:58:19,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:19,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-01-10 00:58:19,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:20,144 INFO L124 PetriNetUnfolderBase]: 2915/5738 cut-off events. [2025-01-10 00:58:20,144 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2025-01-10 00:58:20,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10543 conditions, 5738 events. 2915/5738 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 43590 event pairs, 348 based on Foata normal form. 99/5566 useless extension candidates. Maximal degree in co-relation 9289. Up to 3679 conditions per place. [2025-01-10 00:58:20,169 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 81 selfloop transitions, 5 changer transitions 0/112 dead transitions. [2025-01-10 00:58:20,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 112 transitions, 422 flow [2025-01-10 00:58:20,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:58:20,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:58:20,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2025-01-10 00:58:20,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5241379310344828 [2025-01-10 00:58:20,171 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 168 flow. Second operand 5 states and 228 transitions. [2025-01-10 00:58:20,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 112 transitions, 422 flow [2025-01-10 00:58:20,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 112 transitions, 420 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:58:20,173 INFO L231 Difference]: Finished difference. Result has 76 places, 70 transitions, 179 flow [2025-01-10 00:58:20,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=76, PETRI_TRANSITIONS=70} [2025-01-10 00:58:20,174 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 2 predicate places. [2025-01-10 00:58:20,174 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 70 transitions, 179 flow [2025-01-10 00:58:20,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 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) [2025-01-10 00:58:20,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:20,174 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:58:20,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:58:20,175 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-10 00:58:20,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:20,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1821743298, now seen corresponding path program 1 times [2025-01-10 00:58:20,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:20,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401030776] [2025-01-10 00:58:20,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:20,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:20,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:58:20,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:58:20,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:20,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:20,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:20,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401030776] [2025-01-10 00:58:20,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401030776] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:20,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:20,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:58:20,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059275629] [2025-01-10 00:58:20,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:20,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:58:20,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:20,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:58:20,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:58:20,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 87 [2025-01-10 00:58:20,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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) [2025-01-10 00:58:20,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:20,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 87 [2025-01-10 00:58:20,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:21,039 INFO L124 PetriNetUnfolderBase]: 4741/9210 cut-off events. [2025-01-10 00:58:21,040 INFO L125 PetriNetUnfolderBase]: For 932/932 co-relation queries the response was YES. [2025-01-10 00:58:21,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17272 conditions, 9210 events. 4741/9210 cut-off events. For 932/932 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 69144 event pairs, 1594 based on Foata normal form. 0/8460 useless extension candidates. Maximal degree in co-relation 13274. Up to 3661 conditions per place. [2025-01-10 00:58:21,092 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 119 selfloop transitions, 7 changer transitions 0/152 dead transitions. [2025-01-10 00:58:21,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 152 transitions, 631 flow [2025-01-10 00:58:21,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:58:21,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:58:21,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 269 transitions. [2025-01-10 00:58:21,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6183908045977011 [2025-01-10 00:58:21,094 INFO L175 Difference]: Start difference. First operand has 76 places, 70 transitions, 179 flow. Second operand 5 states and 269 transitions. [2025-01-10 00:58:21,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 152 transitions, 631 flow [2025-01-10 00:58:21,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 152 transitions, 614 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-10 00:58:21,102 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 219 flow [2025-01-10 00:58:21,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2025-01-10 00:58:21,105 INFO L279 CegarLoopForPetriNet]: 74 programPoint places, 7 predicate places. [2025-01-10 00:58:21,105 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 219 flow [2025-01-10 00:58:21,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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) [2025-01-10 00:58:21,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:21,106 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2025-01-10 00:58:21,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:58:21,106 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-01-10 00:58:21,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:21,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1202312373, now seen corresponding path program 1 times [2025-01-10 00:58:21,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:21,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114070561] [2025-01-10 00:58:21,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:21,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:21,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:58:21,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:58:21,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:21,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:58:21,144 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:58:21,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:58:21,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:58:21,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:21,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:58:21,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:58:21,178 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:58:21,179 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-01-10 00:58:21,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2025-01-10 00:58:21,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2025-01-10 00:58:21,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2025-01-10 00:58:21,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2025-01-10 00:58:21,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (3 of 9 remaining) [2025-01-10 00:58:21,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 9 remaining) [2025-01-10 00:58:21,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 9 remaining) [2025-01-10 00:58:21,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2025-01-10 00:58:21,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:58:21,180 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-10 00:58:21,181 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:58:21,181 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 00:58:21,204 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 00:58:21,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 109 transitions, 245 flow [2025-01-10 00:58:21,222 INFO L124 PetriNetUnfolderBase]: 52/271 cut-off events. [2025-01-10 00:58:21,223 INFO L125 PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES. [2025-01-10 00:58:21,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 271 events. 52/271 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1245 event pairs, 1 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 188. Up to 12 conditions per place. [2025-01-10 00:58:21,224 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 109 transitions, 245 flow [2025-01-10 00:58:21,225 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 109 transitions, 245 flow [2025-01-10 00:58:21,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:58:21,226 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;@690fb020, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:58:21,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 00:58:21,228 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:58:21,228 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:58:21,228 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:58:21,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:21,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:58:21,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-01-10 00:58:21,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:21,229 INFO L85 PathProgramCache]: Analyzing trace with hash 697849, now seen corresponding path program 1 times [2025-01-10 00:58:21,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:21,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727891453] [2025-01-10 00:58:21,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:21,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:21,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:58:21,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:58:21,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:21,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:21,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:21,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727891453] [2025-01-10 00:58:21,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727891453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:21,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:21,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:21,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788428119] [2025-01-10 00:58:21,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:21,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:21,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:21,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:21,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:21,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 109 [2025-01-10 00:58:21,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 109 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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) [2025-01-10 00:58:21,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:21,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 109 [2025-01-10 00:58:21,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:25,516 INFO L124 PetriNetUnfolderBase]: 44624/74164 cut-off events. [2025-01-10 00:58:25,517 INFO L125 PetriNetUnfolderBase]: For 1078/1078 co-relation queries the response was YES. [2025-01-10 00:58:25,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136836 conditions, 74164 events. 44624/74164 cut-off events. For 1078/1078 co-relation queries the response was YES. Maximal size of possible extension queue 2207. Compared 671421 event pairs, 38073 based on Foata normal form. 18973/89420 useless extension candidates. Maximal degree in co-relation 42401. Up to 55214 conditions per place. [2025-01-10 00:58:26,002 INFO L140 encePairwiseOnDemand]: 87/109 looper letters, 75 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2025-01-10 00:58:26,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 110 transitions, 401 flow [2025-01-10 00:58:26,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2025-01-10 00:58:26,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.636085626911315 [2025-01-10 00:58:26,004 INFO L175 Difference]: Start difference. First operand has 93 places, 109 transitions, 245 flow. Second operand 3 states and 208 transitions. [2025-01-10 00:58:26,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 110 transitions, 401 flow [2025-01-10 00:58:26,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 110 transitions, 401 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:58:26,007 INFO L231 Difference]: Finished difference. Result has 90 places, 86 transitions, 203 flow [2025-01-10 00:58:26,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=90, PETRI_TRANSITIONS=86} [2025-01-10 00:58:26,010 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, -3 predicate places. [2025-01-10 00:58:26,010 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 86 transitions, 203 flow [2025-01-10 00:58:26,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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) [2025-01-10 00:58:26,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:26,012 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:58:26,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:58:26,012 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-01-10 00:58:26,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:26,012 INFO L85 PathProgramCache]: Analyzing trace with hash 697850, now seen corresponding path program 1 times [2025-01-10 00:58:26,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:26,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440052845] [2025-01-10 00:58:26,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:26,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:26,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:58:26,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:58:26,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:26,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:26,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:26,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:26,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440052845] [2025-01-10 00:58:26,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440052845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:26,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:26,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:26,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515100953] [2025-01-10 00:58:26,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:26,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:26,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:26,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:26,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:26,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 109 [2025-01-10 00:58:26,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 86 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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) [2025-01-10 00:58:26,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:26,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 109 [2025-01-10 00:58:26,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:30,282 INFO L124 PetriNetUnfolderBase]: 42221/71131 cut-off events. [2025-01-10 00:58:30,282 INFO L125 PetriNetUnfolderBase]: For 2055/2065 co-relation queries the response was YES. [2025-01-10 00:58:30,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131389 conditions, 71131 events. 42221/71131 cut-off events. For 2055/2065 co-relation queries the response was YES. Maximal size of possible extension queue 2096. Compared 647516 event pairs, 26281 based on Foata normal form. 1/67439 useless extension candidates. Maximal degree in co-relation 115412. Up to 58588 conditions per place. [2025-01-10 00:58:30,666 INFO L140 encePairwiseOnDemand]: 105/109 looper letters, 60 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2025-01-10 00:58:30,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 96 transitions, 347 flow [2025-01-10 00:58:30,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:30,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2025-01-10 00:58:30,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5259938837920489 [2025-01-10 00:58:30,668 INFO L175 Difference]: Start difference. First operand has 90 places, 86 transitions, 203 flow. Second operand 3 states and 172 transitions. [2025-01-10 00:58:30,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 96 transitions, 347 flow [2025-01-10 00:58:30,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 96 transitions, 343 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:58:30,720 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 213 flow [2025-01-10 00:58:30,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=91, PETRI_TRANSITIONS=87} [2025-01-10 00:58:30,721 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, -2 predicate places. [2025-01-10 00:58:30,721 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 213 flow [2025-01-10 00:58:30,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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) [2025-01-10 00:58:30,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:30,721 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 00:58:30,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:58:30,722 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-01-10 00:58:30,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:30,722 INFO L85 PathProgramCache]: Analyzing trace with hash 255754214, now seen corresponding path program 1 times [2025-01-10 00:58:30,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:30,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833152713] [2025-01-10 00:58:30,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:30,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:30,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:58:30,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:58:30,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:30,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:30,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:30,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:30,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833152713] [2025-01-10 00:58:30,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833152713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:30,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:30,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:58:30,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959235076] [2025-01-10 00:58:30,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:30,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:58:30,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:30,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:58:30,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:58:30,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 109 [2025-01-10 00:58:30,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 87 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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) [2025-01-10 00:58:30,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:30,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 109 [2025-01-10 00:58:30,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:34,766 INFO L124 PetriNetUnfolderBase]: 42213/71487 cut-off events. [2025-01-10 00:58:34,766 INFO L125 PetriNetUnfolderBase]: For 3721/3740 co-relation queries the response was YES. [2025-01-10 00:58:34,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133186 conditions, 71487 events. 42213/71487 cut-off events. For 3721/3740 co-relation queries the response was YES. Maximal size of possible extension queue 2121. Compared 659530 event pairs, 12351 based on Foata normal form. 9/68867 useless extension candidates. Maximal degree in co-relation 118221. Up to 58384 conditions per place. [2025-01-10 00:58:35,108 INFO L140 encePairwiseOnDemand]: 105/109 looper letters, 77 selfloop transitions, 4 changer transitions 0/115 dead transitions. [2025-01-10 00:58:35,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 115 transitions, 435 flow [2025-01-10 00:58:35,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:58:35,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:58:35,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2025-01-10 00:58:35,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.518348623853211 [2025-01-10 00:58:35,110 INFO L175 Difference]: Start difference. First operand has 91 places, 87 transitions, 213 flow. Second operand 4 states and 226 transitions. [2025-01-10 00:58:35,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 115 transitions, 435 flow [2025-01-10 00:58:35,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 115 transitions, 433 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:58:35,115 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 236 flow [2025-01-10 00:58:35,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2025-01-10 00:58:35,115 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 1 predicate places. [2025-01-10 00:58:35,115 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 236 flow [2025-01-10 00:58:35,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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) [2025-01-10 00:58:35,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:35,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:58:35,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:58:35,116 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-01-10 00:58:35,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:35,117 INFO L85 PathProgramCache]: Analyzing trace with hash 966693129, now seen corresponding path program 1 times [2025-01-10 00:58:35,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:35,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245165142] [2025-01-10 00:58:35,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:35,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:35,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:58:35,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:58:35,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:35,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:35,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:35,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:35,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245165142] [2025-01-10 00:58:35,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245165142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:35,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:35,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:58:35,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234572351] [2025-01-10 00:58:35,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:35,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:58:35,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:35,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:58:35,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:58:35,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 109 [2025-01-10 00:58:35,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 236 flow. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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) [2025-01-10 00:58:35,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:35,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 109 [2025-01-10 00:58:35,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:39,152 INFO L124 PetriNetUnfolderBase]: 40002/68209 cut-off events. [2025-01-10 00:58:39,153 INFO L125 PetriNetUnfolderBase]: For 6099/6099 co-relation queries the response was YES. [2025-01-10 00:58:39,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128311 conditions, 68209 events. 40002/68209 cut-off events. For 6099/6099 co-relation queries the response was YES. Maximal size of possible extension queue 2014. Compared 629461 event pairs, 11704 based on Foata normal form. 9/65511 useless extension candidates. Maximal degree in co-relation 10983. Up to 55255 conditions per place. [2025-01-10 00:58:39,487 INFO L140 encePairwiseOnDemand]: 106/109 looper letters, 76 selfloop transitions, 3 changer transitions 0/114 dead transitions. [2025-01-10 00:58:39,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 114 transitions, 439 flow [2025-01-10 00:58:39,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:58:39,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:58:39,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2025-01-10 00:58:39,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5229357798165137 [2025-01-10 00:58:39,489 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 236 flow. Second operand 4 states and 228 transitions. [2025-01-10 00:58:39,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 114 transitions, 439 flow [2025-01-10 00:58:39,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 114 transitions, 433 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:58:39,492 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 229 flow [2025-01-10 00:58:39,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=229, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2025-01-10 00:58:39,493 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 2 predicate places. [2025-01-10 00:58:39,493 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 229 flow [2025-01-10 00:58:39,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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) [2025-01-10 00:58:39,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:39,493 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-01-10 00:58:39,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:58:39,493 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-01-10 00:58:39,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:39,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1272707121, now seen corresponding path program 1 times [2025-01-10 00:58:39,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:39,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240867454] [2025-01-10 00:58:39,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:39,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:39,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:58:39,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:58:39,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:39,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:39,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:39,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240867454] [2025-01-10 00:58:39,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240867454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:39,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:39,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:58:39,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804443387] [2025-01-10 00:58:39,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:39,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:58:39,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:39,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:58:39,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:58:39,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 109 [2025-01-10 00:58:39,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 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) [2025-01-10 00:58:39,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:39,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 109 [2025-01-10 00:58:39,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:43,738 INFO L124 PetriNetUnfolderBase]: 42098/70272 cut-off events. [2025-01-10 00:58:43,738 INFO L125 PetriNetUnfolderBase]: For 8258/8258 co-relation queries the response was YES. [2025-01-10 00:58:43,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132570 conditions, 70272 events. 42098/70272 cut-off events. For 8258/8258 co-relation queries the response was YES. Maximal size of possible extension queue 2050. Compared 641720 event pairs, 1302 based on Foata normal form. 810/68162 useless extension candidates. Maximal degree in co-relation 16201. Up to 47434 conditions per place. [2025-01-10 00:58:44,036 INFO L140 encePairwiseOnDemand]: 104/109 looper letters, 124 selfloop transitions, 6 changer transitions 0/163 dead transitions. [2025-01-10 00:58:44,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 163 transitions, 635 flow [2025-01-10 00:58:44,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:58:44,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:58:44,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 341 transitions. [2025-01-10 00:58:44,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5214067278287462 [2025-01-10 00:58:44,038 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 229 flow. Second operand 6 states and 341 transitions. [2025-01-10 00:58:44,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 163 transitions, 635 flow [2025-01-10 00:58:44,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 163 transitions, 629 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:58:44,043 INFO L231 Difference]: Finished difference. Result has 97 places, 88 transitions, 237 flow [2025-01-10 00:58:44,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=97, PETRI_TRANSITIONS=88} [2025-01-10 00:58:44,043 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 4 predicate places. [2025-01-10 00:58:44,044 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 88 transitions, 237 flow [2025-01-10 00:58:44,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 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) [2025-01-10 00:58:44,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:44,044 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:58:44,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:58:44,044 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-01-10 00:58:44,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:44,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1073373458, now seen corresponding path program 1 times [2025-01-10 00:58:44,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:44,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7047952] [2025-01-10 00:58:44,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:44,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:44,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:58:44,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:58:44,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:44,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:44,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:44,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:44,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7047952] [2025-01-10 00:58:44,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7047952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:44,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:44,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:58:44,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922119135] [2025-01-10 00:58:44,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:44,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:58:44,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:44,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:58:44,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:58:44,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 109 [2025-01-10 00:58:44,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 88 transitions, 237 flow. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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) [2025-01-10 00:58:44,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:44,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 109 [2025-01-10 00:58:44,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:49,865 INFO L124 PetriNetUnfolderBase]: 68744/113350 cut-off events. [2025-01-10 00:58:49,865 INFO L125 PetriNetUnfolderBase]: For 15303/15318 co-relation queries the response was YES. [2025-01-10 00:58:50,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216723 conditions, 113350 events. 68744/113350 cut-off events. For 15303/15318 co-relation queries the response was YES. Maximal size of possible extension queue 2174. Compared 1024008 event pairs, 22552 based on Foata normal form. 0/106048 useless extension candidates. Maximal degree in co-relation 61845. Up to 47254 conditions per place. [2025-01-10 00:58:50,648 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 159 selfloop transitions, 7 changer transitions 0/199 dead transitions. [2025-01-10 00:58:50,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 199 transitions, 854 flow [2025-01-10 00:58:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:58:50,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:58:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 342 transitions. [2025-01-10 00:58:50,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6275229357798165 [2025-01-10 00:58:50,651 INFO L175 Difference]: Start difference. First operand has 97 places, 88 transitions, 237 flow. Second operand 5 states and 342 transitions. [2025-01-10 00:58:50,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 199 transitions, 854 flow [2025-01-10 00:58:50,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 199 transitions, 821 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-01-10 00:58:50,661 INFO L231 Difference]: Finished difference. Result has 100 places, 93 transitions, 269 flow [2025-01-10 00:58:50,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=100, PETRI_TRANSITIONS=93} [2025-01-10 00:58:50,661 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 7 predicate places. [2025-01-10 00:58:50,661 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 93 transitions, 269 flow [2025-01-10 00:58:50,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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) [2025-01-10 00:58:50,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:50,662 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:58:50,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:58:50,662 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2025-01-10 00:58:50,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:50,663 INFO L85 PathProgramCache]: Analyzing trace with hash -994106732, now seen corresponding path program 1 times [2025-01-10 00:58:50,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:50,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948957472] [2025-01-10 00:58:50,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:50,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:50,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:58:50,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:58:50,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:50,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:50,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:50,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:50,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948957472] [2025-01-10 00:58:50,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948957472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:50,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:50,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:58:50,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786492494] [2025-01-10 00:58:50,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:50,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:50,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:50,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:50,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:50,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 109 [2025-01-10 00:58:50,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 93 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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) [2025-01-10 00:58:50,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:50,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 109 [2025-01-10 00:58:50,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand