./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe016_power.opt.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/pthread-wmm/safe016_power.opt.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 6b69d29db6700923687b32c5d8fab6e8f05fe2198d87348098263d957793e472 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:50:27,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:50:27,432 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:50:27,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:50:27,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:50:27,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:50:27,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:50:27,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:50:27,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:50:27,453 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:50:27,453 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:50:27,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:50:27,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:50:27,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:50:27,454 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:50:27,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:50:27,454 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:50:27,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:50:27,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:50:27,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:50:27,454 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:50:27,454 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:50:27,454 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:50:27,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:50:27,455 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:50:27,455 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:50:27,455 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:50:27,455 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:50:27,455 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:50:27,455 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:50:27,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:50:27,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:50:27,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:50:27,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:50:27,455 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:50:27,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:50:27,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:50:27,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:50:27,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:50:27,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:50:27,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:50:27,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:50:27,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:50:27,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:50:27,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:50:27,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:50:27,457 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:50:27,457 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 -> 6b69d29db6700923687b32c5d8fab6e8f05fe2198d87348098263d957793e472 [2025-01-10 00:50:27,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:50:27,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:50:27,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:50:27,668 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:50:27,669 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:50:27,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe016_power.opt.i [2025-01-10 00:50:28,870 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b36bf3eaa/1aa9a87f439e460a9ca8b28128d40a83/FLAG4daf66f3d [2025-01-10 00:50:29,214 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:50:29,215 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe016_power.opt.i [2025-01-10 00:50:29,224 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b36bf3eaa/1aa9a87f439e460a9ca8b28128d40a83/FLAG4daf66f3d [2025-01-10 00:50:29,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b36bf3eaa/1aa9a87f439e460a9ca8b28128d40a83 [2025-01-10 00:50:29,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:50:29,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:50:29,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:50:29,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:50:29,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:50:29,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:50:29" (1/1) ... [2025-01-10 00:50:29,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@141ccf63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:29, skipping insertion in model container [2025-01-10 00:50:29,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:50:29" (1/1) ... [2025-01-10 00:50:29,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:50:29,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:50:29,784 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:50:29,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:50:29,869 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:50:29,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:29 WrapperNode [2025-01-10 00:50:29,870 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:50:29,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:50:29,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:50:29,871 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:50:29,875 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:50:29" (1/1) ... [2025-01-10 00:50:29,885 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:50:29" (1/1) ... [2025-01-10 00:50:29,902 INFO L138 Inliner]: procedures = 176, calls = 76, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 172 [2025-01-10 00:50:29,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:50:29,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:50:29,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:50:29,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:50:29,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:29" (1/1) ... [2025-01-10 00:50:29,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:29" (1/1) ... [2025-01-10 00:50:29,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:29" (1/1) ... [2025-01-10 00:50:29,926 INFO L175 MemorySlicer]: Split 30 memory accesses to 2 slices as follows [2, 28]. 93 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 11 writes are split as follows [0, 11]. [2025-01-10 00:50:29,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:29" (1/1) ... [2025-01-10 00:50:29,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:29" (1/1) ... [2025-01-10 00:50:29,933 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:29" (1/1) ... [2025-01-10 00:50:29,934 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:29" (1/1) ... [2025-01-10 00:50:29,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:29" (1/1) ... [2025-01-10 00:50:29,938 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:29" (1/1) ... [2025-01-10 00:50:29,939 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:29" (1/1) ... [2025-01-10 00:50:29,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:50:29,942 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:50:29,942 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:50:29,942 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:50:29,943 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:29" (1/1) ... [2025-01-10 00:50:29,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:50:29,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:50:29,971 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:50:29,986 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:50:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:50:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:50:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:50:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:50:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:50:30,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:50:30,020 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:50:30,020 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:50:30,021 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:50:30,021 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:50:30,021 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:50:30,021 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:50:30,021 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-01-10 00:50:30,021 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-01-10 00:50:30,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:50:30,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:50:30,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:50:30,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:50:30,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:50:30,022 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:50:30,179 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:50:30,181 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:50:30,774 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:50:30,774 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:50:31,294 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:50:31,295 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:50:31,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:50:31 BoogieIcfgContainer [2025-01-10 00:50:31,295 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:50:31,296 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:50:31,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:50:31,300 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:50:31,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:50:29" (1/3) ... [2025-01-10 00:50:31,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af5a902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:50:31, skipping insertion in model container [2025-01-10 00:50:31,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:29" (2/3) ... [2025-01-10 00:50:31,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af5a902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:50:31, skipping insertion in model container [2025-01-10 00:50:31,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:50:31" (3/3) ... [2025-01-10 00:50:31,302 INFO L128 eAbstractionObserver]: Analyzing ICFG safe016_power.opt.i [2025-01-10 00:50:31,313 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:50:31,316 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe016_power.opt.i that has 5 procedures, 103 locations, 1 initial locations, 0 loop locations, and 56 error locations. [2025-01-10 00:50:31,316 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:50:31,481 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:50:31,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 104 transitions, 224 flow [2025-01-10 00:50:31,556 INFO L124 PetriNetUnfolderBase]: 2/100 cut-off events. [2025-01-10 00:50:31,558 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:50:31,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 403 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2025-01-10 00:50:31,561 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 104 transitions, 224 flow [2025-01-10 00:50:31,565 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 100 transitions, 212 flow [2025-01-10 00:50:31,570 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:50:31,585 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;@61bd084f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:50:31,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2025-01-10 00:50:31,590 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:50:31,590 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2025-01-10 00:50:31,590 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:50:31,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:31,591 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:50:31,591 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:50:31,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:31,595 INFO L85 PathProgramCache]: Analyzing trace with hash 977855809, now seen corresponding path program 1 times [2025-01-10 00:50:31,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:31,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198352718] [2025-01-10 00:50:31,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:31,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:31,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:50:31,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:50:31,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:31,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:31,790 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:50:31,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:31,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198352718] [2025-01-10 00:50:31,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198352718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:31,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:31,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:50:31,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500133469] [2025-01-10 00:50:31,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:31,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:50:31,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:31,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:50:31,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:50:31,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 104 [2025-01-10 00:50:31,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 100 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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:50:31,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:31,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 104 [2025-01-10 00:50:31,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:47,532 INFO L124 PetriNetUnfolderBase]: 81178/115730 cut-off events. [2025-01-10 00:50:47,532 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-01-10 00:50:47,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222523 conditions, 115730 events. 81178/115730 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 7138. Compared 955126 event pairs, 81178 based on Foata normal form. 3430/68295 useless extension candidates. Maximal degree in co-relation 222511. Up to 105987 conditions per place. [2025-01-10 00:50:48,329 INFO L140 encePairwiseOnDemand]: 63/104 looper letters, 42 selfloop transitions, 1 changer transitions 0/59 dead transitions. [2025-01-10 00:50:48,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 59 transitions, 216 flow [2025-01-10 00:50:48,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:50:48,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:50:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2025-01-10 00:50:48,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-01-10 00:50:48,339 INFO L175 Difference]: Start difference. First operand has 111 places, 100 transitions, 212 flow. Second operand 3 states and 143 transitions. [2025-01-10 00:50:48,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 59 transitions, 216 flow [2025-01-10 00:50:48,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 59 transitions, 212 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:50:48,396 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 128 flow [2025-01-10 00:50:48,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2025-01-10 00:50:48,400 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -41 predicate places. [2025-01-10 00:50:48,400 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 128 flow [2025-01-10 00:50:48,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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:50:48,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:48,401 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:50:48,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:50:48,401 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:50:48,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:48,402 INFO L85 PathProgramCache]: Analyzing trace with hash 977855810, now seen corresponding path program 1 times [2025-01-10 00:50:48,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:48,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561705458] [2025-01-10 00:50:48,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:48,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:48,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:50:48,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:50:48,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:48,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:48,578 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:50:48,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:48,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561705458] [2025-01-10 00:50:48,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561705458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:48,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:48,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:50:48,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112235527] [2025-01-10 00:50:48,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:48,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:50:48,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:48,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:50:48,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:50:48,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 104 [2025-01-10 00:50:48,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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:50:48,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:48,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 104 [2025-01-10 00:50:48,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:50,085 INFO L124 PetriNetUnfolderBase]: 6311/9802 cut-off events. [2025-01-10 00:50:50,086 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:50:50,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18568 conditions, 9802 events. 6311/9802 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 67188 event pairs, 6311 based on Foata normal form. 0/9243 useless extension candidates. Maximal degree in co-relation 18562. Up to 8592 conditions per place. [2025-01-10 00:50:50,126 INFO L140 encePairwiseOnDemand]: 89/104 looper letters, 27 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2025-01-10 00:50:50,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 158 flow [2025-01-10 00:50:50,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:50:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:50:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-01-10 00:50:50,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3301282051282051 [2025-01-10 00:50:50,128 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 128 flow. Second operand 3 states and 103 transitions. [2025-01-10 00:50:50,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 158 flow [2025-01-10 00:50:50,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 45 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:50:50,129 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 99 flow [2025-01-10 00:50:50,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2025-01-10 00:50:50,130 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -54 predicate places. [2025-01-10 00:50:50,130 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 99 flow [2025-01-10 00:50:50,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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:50:50,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:50,130 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:50:50,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:50:50,130 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:50:50,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:50,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1238085401, now seen corresponding path program 1 times [2025-01-10 00:50:50,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:50,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294221349] [2025-01-10 00:50:50,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:50,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:50,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:50:50,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:50:50,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:50,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:50,437 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:50:50,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:50,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294221349] [2025-01-10 00:50:50,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294221349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:50,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:50,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:50:50,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601869220] [2025-01-10 00:50:50,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:50,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:50:50,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:50,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:50:50,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:50:50,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 104 [2025-01-10 00:50:50,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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:50:50,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:50,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 104 [2025-01-10 00:50:50,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:51,961 INFO L124 PetriNetUnfolderBase]: 5447/8462 cut-off events. [2025-01-10 00:50:51,961 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:50:51,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16077 conditions, 8462 events. 5447/8462 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 55983 event pairs, 1783 based on Foata normal form. 0/8131 useless extension candidates. Maximal degree in co-relation 16070. Up to 6097 conditions per place. [2025-01-10 00:50:52,007 INFO L140 encePairwiseOnDemand]: 100/104 looper letters, 43 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2025-01-10 00:50:52,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 225 flow [2025-01-10 00:50:52,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:50:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:50:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-01-10 00:50:52,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34294871794871795 [2025-01-10 00:50:52,011 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 99 flow. Second operand 3 states and 107 transitions. [2025-01-10 00:50:52,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 225 flow [2025-01-10 00:50:52,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 61 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:50:52,012 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 108 flow [2025-01-10 00:50:52,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2025-01-10 00:50:52,013 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -53 predicate places. [2025-01-10 00:50:52,013 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 108 flow [2025-01-10 00:50:52,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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:50:52,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:52,014 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:50:52,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:50:52,014 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:50:52,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:52,015 INFO L85 PathProgramCache]: Analyzing trace with hash -94034154, now seen corresponding path program 1 times [2025-01-10 00:50:52,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:52,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979303229] [2025-01-10 00:50:52,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:52,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:52,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:50:52,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:50:52,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:52,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:52,398 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:50:52,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:52,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979303229] [2025-01-10 00:50:52,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979303229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:52,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:52,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:50:52,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937777674] [2025-01-10 00:50:52,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:52,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:50:52,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:52,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:50:52,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:50:52,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 104 [2025-01-10 00:50:52,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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:50:52,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:52,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 104 [2025-01-10 00:50:52,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:53,220 INFO L124 PetriNetUnfolderBase]: 5039/7910 cut-off events. [2025-01-10 00:50:53,220 INFO L125 PetriNetUnfolderBase]: For 544/544 co-relation queries the response was YES. [2025-01-10 00:50:53,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15951 conditions, 7910 events. 5039/7910 cut-off events. For 544/544 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 52141 event pairs, 1591 based on Foata normal form. 0/7867 useless extension candidates. Maximal degree in co-relation 15942. Up to 5544 conditions per place. [2025-01-10 00:50:53,275 INFO L140 encePairwiseOnDemand]: 101/104 looper letters, 42 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2025-01-10 00:50:53,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 60 transitions, 228 flow [2025-01-10 00:50:53,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:50:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:50:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2025-01-10 00:50:53,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3004807692307692 [2025-01-10 00:50:53,278 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 108 flow. Second operand 4 states and 125 transitions. [2025-01-10 00:50:53,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 60 transitions, 228 flow [2025-01-10 00:50:53,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 60 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:50:53,280 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 104 flow [2025-01-10 00:50:53,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2025-01-10 00:50:53,281 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -53 predicate places. [2025-01-10 00:50:53,281 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 104 flow [2025-01-10 00:50:53,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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:50:53,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:53,281 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:50:53,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:50:53,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:50:53,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:53,282 INFO L85 PathProgramCache]: Analyzing trace with hash -94034155, now seen corresponding path program 1 times [2025-01-10 00:50:53,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:53,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386832879] [2025-01-10 00:50:53,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:53,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:53,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:50:53,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:50:53,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:53,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:53,437 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:50:53,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:53,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386832879] [2025-01-10 00:50:53,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386832879] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:53,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:53,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:50:53,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004575485] [2025-01-10 00:50:53,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:53,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:50:53,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:53,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:50:53,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:50:53,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 104 [2025-01-10 00:50:53,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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:50:53,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:53,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 104 [2025-01-10 00:50:53,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:54,171 INFO L124 PetriNetUnfolderBase]: 4631/7358 cut-off events. [2025-01-10 00:50:54,171 INFO L125 PetriNetUnfolderBase]: For 544/544 co-relation queries the response was YES. [2025-01-10 00:50:54,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14703 conditions, 7358 events. 4631/7358 cut-off events. For 544/544 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 48646 event pairs, 1399 based on Foata normal form. 144/7459 useless extension candidates. Maximal degree in co-relation 14694. Up to 4992 conditions per place. [2025-01-10 00:50:54,205 INFO L140 encePairwiseOnDemand]: 101/104 looper letters, 41 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2025-01-10 00:50:54,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 222 flow [2025-01-10 00:50:54,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:50:54,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:50:54,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2025-01-10 00:50:54,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2980769230769231 [2025-01-10 00:50:54,207 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 104 flow. Second operand 4 states and 124 transitions. [2025-01-10 00:50:54,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 222 flow [2025-01-10 00:50:54,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 59 transitions, 217 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:50:54,209 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 99 flow [2025-01-10 00:50:54,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2025-01-10 00:50:54,210 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -54 predicate places. [2025-01-10 00:50:54,210 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 99 flow [2025-01-10 00:50:54,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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:50:54,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:54,210 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:50:54,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:50:54,210 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:50:54,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:54,211 INFO L85 PathProgramCache]: Analyzing trace with hash -227323458, now seen corresponding path program 1 times [2025-01-10 00:50:54,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:54,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394047207] [2025-01-10 00:50:54,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:54,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:54,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:50:54,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:50:54,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:54,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:54,256 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:50:54,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:54,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394047207] [2025-01-10 00:50:54,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394047207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:54,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:54,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:50:54,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627743740] [2025-01-10 00:50:54,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:54,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:50:54,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:54,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:50:54,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:50:54,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 104 [2025-01-10 00:50:54,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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:50:54,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:54,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 104 [2025-01-10 00:50:54,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:55,022 INFO L124 PetriNetUnfolderBase]: 4631/7354 cut-off events. [2025-01-10 00:50:55,023 INFO L125 PetriNetUnfolderBase]: For 416/416 co-relation queries the response was YES. [2025-01-10 00:50:55,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14698 conditions, 7354 events. 4631/7354 cut-off events. For 416/416 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 49631 event pairs, 4631 based on Foata normal form. 192/7371 useless extension candidates. Maximal degree in co-relation 14690. Up to 6336 conditions per place. [2025-01-10 00:50:55,053 INFO L140 encePairwiseOnDemand]: 102/104 looper letters, 24 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2025-01-10 00:50:55,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 41 transitions, 149 flow [2025-01-10 00:50:55,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:50:55,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:50:55,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-01-10 00:50:55,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2692307692307692 [2025-01-10 00:50:55,055 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 99 flow. Second operand 3 states and 84 transitions. [2025-01-10 00:50:55,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 41 transitions, 149 flow [2025-01-10 00:50:55,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 41 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:50:55,057 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 94 flow [2025-01-10 00:50:55,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2025-01-10 00:50:55,058 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -55 predicate places. [2025-01-10 00:50:55,058 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 94 flow [2025-01-10 00:50:55,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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:50:55,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:55,058 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:50:55,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:50:55,059 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:50:55,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:55,059 INFO L85 PathProgramCache]: Analyzing trace with hash -227322177, now seen corresponding path program 1 times [2025-01-10 00:50:55,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:55,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379998107] [2025-01-10 00:50:55,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:55,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:55,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:50:55,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:50:55,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:55,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:55,397 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:50:55,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:55,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379998107] [2025-01-10 00:50:55,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379998107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:55,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:55,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:50:55,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770059503] [2025-01-10 00:50:55,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:55,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:50:55,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:55,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:50:55,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:50:55,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 104 [2025-01-10 00:50:55,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:50:55,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:55,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 104 [2025-01-10 00:50:55,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:57,271 INFO L124 PetriNetUnfolderBase]: 12622/18517 cut-off events. [2025-01-10 00:50:57,272 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:50:57,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37628 conditions, 18517 events. 12622/18517 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 122561 event pairs, 1338 based on Foata normal form. 500/18888 useless extension candidates. Maximal degree in co-relation 37620. Up to 10831 conditions per place. [2025-01-10 00:50:57,377 INFO L140 encePairwiseOnDemand]: 97/104 looper letters, 57 selfloop transitions, 6 changer transitions 1/74 dead transitions. [2025-01-10 00:50:57,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 74 transitions, 300 flow [2025-01-10 00:50:57,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:50:57,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:50:57,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2025-01-10 00:50:57,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30288461538461536 [2025-01-10 00:50:57,379 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 94 flow. Second operand 4 states and 126 transitions. [2025-01-10 00:50:57,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 74 transitions, 300 flow [2025-01-10 00:50:57,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 74 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:50:57,381 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 135 flow [2025-01-10 00:50:57,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2025-01-10 00:50:57,382 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -52 predicate places. [2025-01-10 00:50:57,382 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 135 flow [2025-01-10 00:50:57,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:50:57,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:57,382 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:50:57,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:50:57,382 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:50:57,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:57,383 INFO L85 PathProgramCache]: Analyzing trace with hash -88558017, now seen corresponding path program 1 times [2025-01-10 00:50:57,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:57,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943500566] [2025-01-10 00:50:57,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:57,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:57,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:50:57,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:50:57,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:57,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:57,604 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:50:57,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:57,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943500566] [2025-01-10 00:50:57,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943500566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:57,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:57,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:50:57,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271245495] [2025-01-10 00:50:57,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:57,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:50:57,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:57,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:50:57,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:50:57,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 104 [2025-01-10 00:50:57,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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:50:57,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:57,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 104 [2025-01-10 00:50:57,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:50:59,436 INFO L124 PetriNetUnfolderBase]: 9166/13549 cut-off events. [2025-01-10 00:50:59,437 INFO L125 PetriNetUnfolderBase]: For 2993/2993 co-relation queries the response was YES. [2025-01-10 00:50:59,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31681 conditions, 13549 events. 9166/13549 cut-off events. For 2993/2993 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 85116 event pairs, 646 based on Foata normal form. 446/13900 useless extension candidates. Maximal degree in co-relation 31670. Up to 6457 conditions per place. [2025-01-10 00:50:59,527 INFO L140 encePairwiseOnDemand]: 97/104 looper letters, 73 selfloop transitions, 10 changer transitions 1/94 dead transitions. [2025-01-10 00:50:59,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 94 transitions, 438 flow [2025-01-10 00:50:59,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:50:59,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:50:59,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2025-01-10 00:50:59,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3096153846153846 [2025-01-10 00:50:59,528 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 135 flow. Second operand 5 states and 161 transitions. [2025-01-10 00:50:59,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 94 transitions, 438 flow [2025-01-10 00:50:59,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 94 transitions, 427 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:50:59,532 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 187 flow [2025-01-10 00:50:59,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2025-01-10 00:50:59,533 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -48 predicate places. [2025-01-10 00:50:59,533 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 187 flow [2025-01-10 00:50:59,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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:50:59,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:50:59,533 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:50:59,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:50:59,533 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2025-01-10 00:50:59,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:50:59,534 INFO L85 PathProgramCache]: Analyzing trace with hash 27166953, now seen corresponding path program 1 times [2025-01-10 00:50:59,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:50:59,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434393040] [2025-01-10 00:50:59,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:50:59,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:50:59,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 00:50:59,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 00:50:59,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:50:59,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:50:59,800 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:50:59,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:50:59,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434393040] [2025-01-10 00:50:59,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434393040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:50:59,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:50:59,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:50:59,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293996072] [2025-01-10 00:50:59,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:50:59,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:50:59,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:50:59,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:50:59,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:50:59,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 104 [2025-01-10 00:50:59,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 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:50:59,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:50:59,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 104 [2025-01-10 00:50:59,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand