./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 613bf9314e4e3fb6e64527ec38c7e6b39400e524de37a5103e9f06d9db406d3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:30:07,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:30:07,816 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:30:07,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:30:07,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:30:07,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:30:07,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:30:07,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:30:07,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:30:07,847 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:30:07,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:30:07,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:30:07,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:30:07,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:30:07,848 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:30:07,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:30:07,848 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:30:07,848 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:30:07,848 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:30:07,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:30:07,848 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:30:07,848 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:30:07,849 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:30:07,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:30:07,849 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:30:07,849 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:30:07,849 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:30:07,849 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:30:07,849 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:30:07,849 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:30:07,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:30:07,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:30:07,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:30:07,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:30:07,849 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:30:07,849 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:30:07,849 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:30:07,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:30:07,849 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:30:07,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:30:07,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:30:07,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:30:07,849 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/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 -> 613bf9314e4e3fb6e64527ec38c7e6b39400e524de37a5103e9f06d9db406d3d [2025-03-17 14:30:08,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:30:08,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:30:08,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:30:08,099 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:30:08,099 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:30:08,100 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c [2025-03-17 14:30:09,320 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ade04b3f/ddf77223a4c1458c9184c2555bee92c8/FLAG98c4b1eb9 [2025-03-17 14:30:09,573 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:30:09,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c [2025-03-17 14:30:09,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ade04b3f/ddf77223a4c1458c9184c2555bee92c8/FLAG98c4b1eb9 [2025-03-17 14:30:09,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ade04b3f/ddf77223a4c1458c9184c2555bee92c8 [2025-03-17 14:30:09,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:30:09,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:30:09,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:30:09,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:30:09,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:30:09,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:30:09" (1/1) ... [2025-03-17 14:30:09,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@204e8009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:09, skipping insertion in model container [2025-03-17 14:30:09,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:30:09" (1/1) ... [2025-03-17 14:30:09,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:30:09,759 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 14:30:09,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:30:09,769 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:30:09,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:30:09,800 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:30:09,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:09 WrapperNode [2025-03-17 14:30:09,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:30:09,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:30:09,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:30:09,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:30:09,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:09" (1/1) ... [2025-03-17 14:30:09,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:09" (1/1) ... [2025-03-17 14:30:09,829 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 152 [2025-03-17 14:30:09,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:30:09,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:30:09,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:30:09,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:30:09,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:09" (1/1) ... [2025-03-17 14:30:09,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:09" (1/1) ... [2025-03-17 14:30:09,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:09" (1/1) ... [2025-03-17 14:30:09,847 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-17 14:30:09,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:09" (1/1) ... [2025-03-17 14:30:09,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:09" (1/1) ... [2025-03-17 14:30:09,852 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:09" (1/1) ... [2025-03-17 14:30:09,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:09" (1/1) ... [2025-03-17 14:30:09,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:09" (1/1) ... [2025-03-17 14:30:09,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:09" (1/1) ... [2025-03-17 14:30:09,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:30:09,857 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:30:09,857 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:30:09,857 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:30:09,857 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:09" (1/1) ... [2025-03-17 14:30:09,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:30:09,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:09,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:30:09,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:30:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:30:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 14:30:09,899 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 14:30:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 14:30:09,899 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 14:30:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:30:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:30:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:30:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:30:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 14:30:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 14:30:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:30:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:30:09,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:30:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:30:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:30:09,900 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:30:09,965 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:30:09,967 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:30:10,276 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:30:10,276 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:30:10,473 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:30:10,473 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:30:10,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:30:10 BoogieIcfgContainer [2025-03-17 14:30:10,473 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:30:10,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:30:10,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:30:10,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:30:10,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:30:09" (1/3) ... [2025-03-17 14:30:10,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23df0dae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:30:10, skipping insertion in model container [2025-03-17 14:30:10,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:30:09" (2/3) ... [2025-03-17 14:30:10,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23df0dae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:30:10, skipping insertion in model container [2025-03-17 14:30:10,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:30:10" (3/3) ... [2025-03-17 14:30:10,483 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2025-03-17 14:30:10,494 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:30:10,496 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-2-nl.wvr.c that has 3 procedures, 36 locations, 1 initial locations, 3 loop locations, and 10 error locations. [2025-03-17 14:30:10,496 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:30:10,538 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 14:30:10,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 39 transitions, 92 flow [2025-03-17 14:30:10,590 INFO L124 PetriNetUnfolderBase]: 4/37 cut-off events. [2025-03-17 14:30:10,592 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:30:10,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 37 events. 4/37 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 85 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-03-17 14:30:10,595 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 39 transitions, 92 flow [2025-03-17 14:30:10,598 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 36 transitions, 84 flow [2025-03-17 14:30:10,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:30:10,618 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;@b2b15de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:30:10,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-17 14:30:10,621 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:30:10,621 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:30:10,622 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:30:10,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:10,622 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:30:10,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:10,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:10,627 INFO L85 PathProgramCache]: Analyzing trace with hash 430200, now seen corresponding path program 1 times [2025-03-17 14:30:10,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:10,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097085919] [2025-03-17 14:30:10,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:10,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:10,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:30:10,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:30:10,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:10,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:10,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:30:10,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:10,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097085919] [2025-03-17 14:30:10,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097085919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:10,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:10,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:30:10,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050920976] [2025-03-17 14:30:10,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:10,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:30:10,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:10,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:30:10,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:30:10,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-17 14:30:10,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-03-17 14:30:10,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:10,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-17 14:30:10,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:11,037 INFO L124 PetriNetUnfolderBase]: 238/433 cut-off events. [2025-03-17 14:30:11,038 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-17 14:30:11,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 433 events. 238/433 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1817 event pairs, 201 based on Foata normal form. 1/306 useless extension candidates. Maximal degree in co-relation 801. Up to 388 conditions per place. [2025-03-17 14:30:11,045 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 25 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2025-03-17 14:30:11,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 32 transitions, 130 flow [2025-03-17 14:30:11,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:30:11,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:30:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-03-17 14:30:11,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2025-03-17 14:30:11,060 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 84 flow. Second operand 3 states and 54 transitions. [2025-03-17 14:30:11,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 32 transitions, 130 flow [2025-03-17 14:30:11,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 32 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:30:11,068 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 72 flow [2025-03-17 14:30:11,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2025-03-17 14:30:11,074 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2025-03-17 14:30:11,076 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 72 flow [2025-03-17 14:30:11,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-03-17 14:30:11,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:11,076 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:30:11,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:30:11,077 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:11,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:11,077 INFO L85 PathProgramCache]: Analyzing trace with hash 430201, now seen corresponding path program 1 times [2025-03-17 14:30:11,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:11,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173555591] [2025-03-17 14:30:11,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:11,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:11,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:30:11,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:30:11,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:11,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:30:11,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:11,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173555591] [2025-03-17 14:30:11,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173555591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:11,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:11,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:30:11,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588357775] [2025-03-17 14:30:11,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:11,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:30:11,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:11,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:30:11,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:30:11,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-17 14:30:11,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-03-17 14:30:11,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:11,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-17 14:30:11,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:11,518 INFO L124 PetriNetUnfolderBase]: 239/436 cut-off events. [2025-03-17 14:30:11,519 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-17 14:30:11,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 436 events. 239/436 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1839 event pairs, 201 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 825. Up to 393 conditions per place. [2025-03-17 14:30:11,521 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 27 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2025-03-17 14:30:11,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 35 transitions, 142 flow [2025-03-17 14:30:11,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:30:11,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:30:11,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-03-17 14:30:11,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2025-03-17 14:30:11,526 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 72 flow. Second operand 4 states and 64 transitions. [2025-03-17 14:30:11,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 35 transitions, 142 flow [2025-03-17 14:30:11,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 35 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:30:11,528 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 95 flow [2025-03-17 14:30:11,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2025-03-17 14:30:11,529 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2025-03-17 14:30:11,529 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 95 flow [2025-03-17 14:30:11,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-03-17 14:30:11,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:11,530 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:30:11,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:30:11,530 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:11,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:11,531 INFO L85 PathProgramCache]: Analyzing trace with hash 413437249, now seen corresponding path program 1 times [2025-03-17 14:30:11,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:11,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993704391] [2025-03-17 14:30:11,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:11,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:11,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:30:11,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:30:11,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:11,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:11,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:30:11,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:11,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993704391] [2025-03-17 14:30:11,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993704391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:11,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889300201] [2025-03-17 14:30:11,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:11,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:11,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:11,796 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:30:11,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:30:11,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:30:11,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:30:11,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:11,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:11,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:30:11,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:11,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-17 14:30:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:30:12,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:30:12,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889300201] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:30:12,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:30:12,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 14:30:12,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558506266] [2025-03-17 14:30:12,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:30:12,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:30:12,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:12,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:30:12,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:30:12,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-17 14:30:12,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 95 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 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-03-17 14:30:12,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:12,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-17 14:30:12,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:12,461 INFO L124 PetriNetUnfolderBase]: 239/435 cut-off events. [2025-03-17 14:30:12,462 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-17 14:30:12,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 435 events. 239/435 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1841 event pairs, 201 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 832. Up to 389 conditions per place. [2025-03-17 14:30:12,467 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 23 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2025-03-17 14:30:12,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 34 transitions, 151 flow [2025-03-17 14:30:12,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:30:12,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:30:12,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2025-03-17 14:30:12,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33760683760683763 [2025-03-17 14:30:12,469 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 95 flow. Second operand 6 states and 79 transitions. [2025-03-17 14:30:12,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 34 transitions, 151 flow [2025-03-17 14:30:12,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 148 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:30:12,471 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 102 flow [2025-03-17 14:30:12,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2025-03-17 14:30:12,472 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2025-03-17 14:30:12,472 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 102 flow [2025-03-17 14:30:12,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 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-03-17 14:30:12,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:12,473 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:30:12,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:30:12,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:12,677 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:12,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:12,677 INFO L85 PathProgramCache]: Analyzing trace with hash -66728298, now seen corresponding path program 1 times [2025-03-17 14:30:12,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:12,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307794801] [2025-03-17 14:30:12,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:12,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:12,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:30:12,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:30:12,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:12,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:12,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:30:12,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:12,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307794801] [2025-03-17 14:30:12,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307794801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:12,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:12,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:30:12,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543973315] [2025-03-17 14:30:12,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:12,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:30:12,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:12,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:30:12,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:30:12,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-17 14:30:12,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-03-17 14:30:12,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:12,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-17 14:30:12,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:12,825 INFO L124 PetriNetUnfolderBase]: 168/311 cut-off events. [2025-03-17 14:30:12,825 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 14:30:12,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 311 events. 168/311 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1157 event pairs, 136 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 591. Up to 272 conditions per place. [2025-03-17 14:30:12,827 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 24 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2025-03-17 14:30:12,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 150 flow [2025-03-17 14:30:12,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:30:12,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:30:12,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-03-17 14:30:12,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3782051282051282 [2025-03-17 14:30:12,830 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 102 flow. Second operand 4 states and 59 transitions. [2025-03-17 14:30:12,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 150 flow [2025-03-17 14:30:12,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 120 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-17 14:30:12,832 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 72 flow [2025-03-17 14:30:12,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2025-03-17 14:30:12,833 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -6 predicate places. [2025-03-17 14:30:12,833 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 72 flow [2025-03-17 14:30:12,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-03-17 14:30:12,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:12,834 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:30:12,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:30:12,834 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:12,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:12,834 INFO L85 PathProgramCache]: Analyzing trace with hash -66728297, now seen corresponding path program 1 times [2025-03-17 14:30:12,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:12,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594070502] [2025-03-17 14:30:12,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:12,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:12,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:30:12,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:30:12,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:12,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:12,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:30:12,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:12,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594070502] [2025-03-17 14:30:12,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594070502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:12,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:12,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:30:12,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226598831] [2025-03-17 14:30:12,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:12,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:30:12,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:12,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:30:12,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:30:12,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-17 14:30:12,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-03-17 14:30:12,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:12,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-17 14:30:12,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:12,987 INFO L124 PetriNetUnfolderBase]: 180/343 cut-off events. [2025-03-17 14:30:12,987 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 14:30:12,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 343 events. 180/343 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1270 event pairs, 149 based on Foata normal form. 17/299 useless extension candidates. Maximal degree in co-relation 583. Up to 275 conditions per place. [2025-03-17 14:30:12,989 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 24 selfloop transitions, 2 changer transitions 8/38 dead transitions. [2025-03-17 14:30:12,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 156 flow [2025-03-17 14:30:12,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:30:12,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:30:12,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-03-17 14:30:12,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2025-03-17 14:30:12,990 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 72 flow. Second operand 4 states and 76 transitions. [2025-03-17 14:30:12,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 156 flow [2025-03-17 14:30:12,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 38 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:30:12,991 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 81 flow [2025-03-17 14:30:12,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=81, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2025-03-17 14:30:12,992 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -4 predicate places. [2025-03-17 14:30:12,992 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 81 flow [2025-03-17 14:30:12,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-03-17 14:30:12,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:12,992 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:12,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:30:12,992 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:12,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:12,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1255064369, now seen corresponding path program 1 times [2025-03-17 14:30:12,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:12,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851549518] [2025-03-17 14:30:12,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:12,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:12,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:30:13,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:30:13,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:13,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:13,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:30:13,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:13,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851549518] [2025-03-17 14:30:13,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851549518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:13,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:13,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:30:13,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643648486] [2025-03-17 14:30:13,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:13,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:30:13,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:13,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:30:13,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:30:13,170 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-17 14:30:13,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-03-17 14:30:13,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:13,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-17 14:30:13,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:13,240 INFO L124 PetriNetUnfolderBase]: 108/206 cut-off events. [2025-03-17 14:30:13,240 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-17 14:30:13,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 206 events. 108/206 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 619 event pairs, 83 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 425. Up to 175 conditions per place. [2025-03-17 14:30:13,241 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 21 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2025-03-17 14:30:13,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 27 transitions, 115 flow [2025-03-17 14:30:13,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:30:13,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:30:13,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-03-17 14:30:13,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2025-03-17 14:30:13,244 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 81 flow. Second operand 4 states and 60 transitions. [2025-03-17 14:30:13,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 27 transitions, 115 flow [2025-03-17 14:30:13,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 111 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:30:13,245 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 69 flow [2025-03-17 14:30:13,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=69, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2025-03-17 14:30:13,245 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2025-03-17 14:30:13,245 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 69 flow [2025-03-17 14:30:13,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-03-17 14:30:13,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:13,245 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-03-17 14:30:13,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:30:13,245 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:13,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:13,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1307527485, now seen corresponding path program 1 times [2025-03-17 14:30:13,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:13,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298111819] [2025-03-17 14:30:13,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:13,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:13,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:30:13,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:30:13,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:13,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:13,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:30:13,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:13,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298111819] [2025-03-17 14:30:13,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298111819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:13,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:13,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:30:13,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743807084] [2025-03-17 14:30:13,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:13,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:30:13,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:13,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:30:13,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:30:13,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-17 14:30:13,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 69 flow. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 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-03-17 14:30:13,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:13,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-17 14:30:13,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:13,829 INFO L124 PetriNetUnfolderBase]: 205/382 cut-off events. [2025-03-17 14:30:13,830 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-03-17 14:30:13,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 382 events. 205/382 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1485 event pairs, 5 based on Foata normal form. 1/383 useless extension candidates. Maximal degree in co-relation 811. Up to 227 conditions per place. [2025-03-17 14:30:13,832 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 46 selfloop transitions, 14 changer transitions 5/68 dead transitions. [2025-03-17 14:30:13,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 68 transitions, 306 flow [2025-03-17 14:30:13,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:30:13,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:30:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 144 transitions. [2025-03-17 14:30:13,834 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36923076923076925 [2025-03-17 14:30:13,834 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 69 flow. Second operand 10 states and 144 transitions. [2025-03-17 14:30:13,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 68 transitions, 306 flow [2025-03-17 14:30:13,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 68 transitions, 303 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:30:13,836 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 151 flow [2025-03-17 14:30:13,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=151, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2025-03-17 14:30:13,836 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2025-03-17 14:30:13,836 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 151 flow [2025-03-17 14:30:13,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 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-03-17 14:30:13,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:13,837 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-03-17 14:30:13,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:30:13,837 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:13,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:13,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1450981657, now seen corresponding path program 2 times [2025-03-17 14:30:13,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:13,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393079306] [2025-03-17 14:30:13,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:30:13,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:13,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-17 14:30:13,852 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-17 14:30:13,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:30:13,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:30:13,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:13,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393079306] [2025-03-17 14:30:13,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393079306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:13,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:13,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:30:13,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944457201] [2025-03-17 14:30:13,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:13,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:30:13,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:13,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:30:13,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:30:13,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-17 14:30:13,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-03-17 14:30:13,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:13,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-17 14:30:13,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:13,942 INFO L124 PetriNetUnfolderBase]: 148/292 cut-off events. [2025-03-17 14:30:13,942 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2025-03-17 14:30:13,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 292 events. 148/292 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1049 event pairs, 31 based on Foata normal form. 8/299 useless extension candidates. Maximal degree in co-relation 803. Up to 221 conditions per place. [2025-03-17 14:30:13,944 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 37 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-03-17 14:30:13,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 44 transitions, 246 flow [2025-03-17 14:30:13,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:30:13,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:30:13,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-03-17 14:30:13,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47863247863247865 [2025-03-17 14:30:13,945 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 151 flow. Second operand 3 states and 56 transitions. [2025-03-17 14:30:13,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 44 transitions, 246 flow [2025-03-17 14:30:13,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 236 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-17 14:30:13,947 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 155 flow [2025-03-17 14:30:13,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2025-03-17 14:30:13,947 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2025-03-17 14:30:13,947 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 155 flow [2025-03-17 14:30:13,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-03-17 14:30:13,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:13,947 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-03-17 14:30:13,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:30:13,948 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:13,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:13,948 INFO L85 PathProgramCache]: Analyzing trace with hash 671834193, now seen corresponding path program 3 times [2025-03-17 14:30:13,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:13,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645347958] [2025-03-17 14:30:13,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:30:13,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:13,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-17 14:30:13,968 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-17 14:30:13,968 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:30:13,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:30:14,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:14,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645347958] [2025-03-17 14:30:14,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645347958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:14,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:14,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:30:14,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647096414] [2025-03-17 14:30:14,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:14,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:30:14,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:14,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:30:14,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:30:14,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-17 14:30:14,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 155 flow. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 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-03-17 14:30:14,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:14,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-17 14:30:14,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:14,604 INFO L124 PetriNetUnfolderBase]: 190/371 cut-off events. [2025-03-17 14:30:14,605 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2025-03-17 14:30:14,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1127 conditions, 371 events. 190/371 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1462 event pairs, 25 based on Foata normal form. 1/371 useless extension candidates. Maximal degree in co-relation 1103. Up to 223 conditions per place. [2025-03-17 14:30:14,609 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 46 selfloop transitions, 18 changer transitions 5/72 dead transitions. [2025-03-17 14:30:14,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 72 transitions, 435 flow [2025-03-17 14:30:14,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:30:14,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:30:14,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2025-03-17 14:30:14,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2025-03-17 14:30:14,610 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 155 flow. Second operand 10 states and 143 transitions. [2025-03-17 14:30:14,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 72 transitions, 435 flow [2025-03-17 14:30:14,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 72 transitions, 404 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-03-17 14:30:14,615 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 237 flow [2025-03-17 14:30:14,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=237, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2025-03-17 14:30:14,616 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2025-03-17 14:30:14,617 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 237 flow [2025-03-17 14:30:14,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 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-03-17 14:30:14,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:14,618 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-03-17 14:30:14,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:30:14,618 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:14,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:14,618 INFO L85 PathProgramCache]: Analyzing trace with hash 662449049, now seen corresponding path program 4 times [2025-03-17 14:30:14,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:14,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144243433] [2025-03-17 14:30:14,619 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:30:14,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:14,626 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-17 14:30:14,645 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:30:14,649 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:30:14,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:14,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:30:14,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:14,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144243433] [2025-03-17 14:30:14,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144243433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:14,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:14,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:30:14,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093687137] [2025-03-17 14:30:14,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:14,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:30:14,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:14,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:30:14,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:30:15,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-17 14:30:15,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 237 flow. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 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-03-17 14:30:15,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:15,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-17 14:30:15,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:15,225 INFO L124 PetriNetUnfolderBase]: 225/429 cut-off events. [2025-03-17 14:30:15,225 INFO L125 PetriNetUnfolderBase]: For 469/469 co-relation queries the response was YES. [2025-03-17 14:30:15,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1373 conditions, 429 events. 225/429 cut-off events. For 469/469 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1695 event pairs, 34 based on Foata normal form. 1/430 useless extension candidates. Maximal degree in co-relation 1357. Up to 270 conditions per place. [2025-03-17 14:30:15,229 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 54 selfloop transitions, 22 changer transitions 5/83 dead transitions. [2025-03-17 14:30:15,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 83 transitions, 554 flow [2025-03-17 14:30:15,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:30:15,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:30:15,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2025-03-17 14:30:15,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36153846153846153 [2025-03-17 14:30:15,232 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 237 flow. Second operand 10 states and 141 transitions. [2025-03-17 14:30:15,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 83 transitions, 554 flow [2025-03-17 14:30:15,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 83 transitions, 519 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-17 14:30:15,238 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 339 flow [2025-03-17 14:30:15,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=339, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2025-03-17 14:30:15,239 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 23 predicate places. [2025-03-17 14:30:15,240 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 339 flow [2025-03-17 14:30:15,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 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-03-17 14:30:15,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:15,240 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-03-17 14:30:15,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:30:15,240 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:15,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:15,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1857236897, now seen corresponding path program 5 times [2025-03-17 14:30:15,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:15,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29905743] [2025-03-17 14:30:15,241 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:30:15,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:15,249 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-17 14:30:15,269 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:30:15,269 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:30:15,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:30:15,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:15,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29905743] [2025-03-17 14:30:15,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29905743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:15,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:15,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:30:15,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780578198] [2025-03-17 14:30:15,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:15,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:30:15,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:15,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:30:15,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:30:15,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-17 14:30:15,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 339 flow. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 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-03-17 14:30:15,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:15,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-17 14:30:15,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:15,751 INFO L124 PetriNetUnfolderBase]: 206/419 cut-off events. [2025-03-17 14:30:15,751 INFO L125 PetriNetUnfolderBase]: For 805/805 co-relation queries the response was YES. [2025-03-17 14:30:15,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1493 conditions, 419 events. 206/419 cut-off events. For 805/805 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1800 event pairs, 15 based on Foata normal form. 1/420 useless extension candidates. Maximal degree in co-relation 1473. Up to 223 conditions per place. [2025-03-17 14:30:15,754 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 52 selfloop transitions, 27 changer transitions 5/87 dead transitions. [2025-03-17 14:30:15,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 87 transitions, 648 flow [2025-03-17 14:30:15,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:30:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:30:15,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 156 transitions. [2025-03-17 14:30:15,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2025-03-17 14:30:15,756 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 339 flow. Second operand 11 states and 156 transitions. [2025-03-17 14:30:15,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 87 transitions, 648 flow [2025-03-17 14:30:15,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 87 transitions, 634 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-03-17 14:30:15,760 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 429 flow [2025-03-17 14:30:15,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=429, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2025-03-17 14:30:15,761 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 35 predicate places. [2025-03-17 14:30:15,761 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 429 flow [2025-03-17 14:30:15,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 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-03-17 14:30:15,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:15,764 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-03-17 14:30:15,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:30:15,765 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:15,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:15,765 INFO L85 PathProgramCache]: Analyzing trace with hash 280900845, now seen corresponding path program 6 times [2025-03-17 14:30:15,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:15,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719112279] [2025-03-17 14:30:15,765 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:30:15,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:15,770 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-17 14:30:15,776 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-17 14:30:15,776 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 14:30:15,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:30:16,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:16,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719112279] [2025-03-17 14:30:16,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719112279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:16,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:16,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:30:16,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737777581] [2025-03-17 14:30:16,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:16,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:30:16,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:16,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:30:16,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:30:16,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-17 14:30:16,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 429 flow. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 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-03-17 14:30:16,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:16,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-17 14:30:16,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:16,214 INFO L124 PetriNetUnfolderBase]: 218/451 cut-off events. [2025-03-17 14:30:16,214 INFO L125 PetriNetUnfolderBase]: For 1409/1409 co-relation queries the response was YES. [2025-03-17 14:30:16,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1749 conditions, 451 events. 218/451 cut-off events. For 1409/1409 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1998 event pairs, 23 based on Foata normal form. 1/452 useless extension candidates. Maximal degree in co-relation 1721. Up to 287 conditions per place. [2025-03-17 14:30:16,217 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 57 selfloop transitions, 23 changer transitions 5/88 dead transitions. [2025-03-17 14:30:16,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 88 transitions, 738 flow [2025-03-17 14:30:16,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:30:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:30:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 145 transitions. [2025-03-17 14:30:16,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3717948717948718 [2025-03-17 14:30:16,218 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 429 flow. Second operand 10 states and 145 transitions. [2025-03-17 14:30:16,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 88 transitions, 738 flow [2025-03-17 14:30:16,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 88 transitions, 660 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-17 14:30:16,222 INFO L231 Difference]: Finished difference. Result has 78 places, 61 transitions, 452 flow [2025-03-17 14:30:16,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=452, PETRI_PLACES=78, PETRI_TRANSITIONS=61} [2025-03-17 14:30:16,223 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 39 predicate places. [2025-03-17 14:30:16,223 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 61 transitions, 452 flow [2025-03-17 14:30:16,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 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-03-17 14:30:16,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:16,224 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-03-17 14:30:16,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:30:16,224 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:16,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:16,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1271803727, now seen corresponding path program 7 times [2025-03-17 14:30:16,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:16,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856027838] [2025-03-17 14:30:16,224 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:30:16,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:16,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:30:16,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:30:16,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:16,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:30:16,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:16,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856027838] [2025-03-17 14:30:16,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856027838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:16,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:16,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:30:16,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161100991] [2025-03-17 14:30:16,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:16,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:30:16,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:16,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:30:16,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:30:16,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-17 14:30:16,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 61 transitions, 452 flow. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 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-03-17 14:30:16,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:16,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-17 14:30:16,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:16,636 INFO L124 PetriNetUnfolderBase]: 214/438 cut-off events. [2025-03-17 14:30:16,637 INFO L125 PetriNetUnfolderBase]: For 1538/1546 co-relation queries the response was YES. [2025-03-17 14:30:16,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1757 conditions, 438 events. 214/438 cut-off events. For 1538/1546 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1927 event pairs, 23 based on Foata normal form. 9/447 useless extension candidates. Maximal degree in co-relation 1731. Up to 291 conditions per place. [2025-03-17 14:30:16,640 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 51 selfloop transitions, 22 changer transitions 8/84 dead transitions. [2025-03-17 14:30:16,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 84 transitions, 717 flow [2025-03-17 14:30:16,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:30:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:30:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2025-03-17 14:30:16,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.358974358974359 [2025-03-17 14:30:16,641 INFO L175 Difference]: Start difference. First operand has 78 places, 61 transitions, 452 flow. Second operand 10 states and 140 transitions. [2025-03-17 14:30:16,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 84 transitions, 717 flow [2025-03-17 14:30:16,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 84 transitions, 660 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-03-17 14:30:16,645 INFO L231 Difference]: Finished difference. Result has 81 places, 61 transitions, 448 flow [2025-03-17 14:30:16,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=448, PETRI_PLACES=81, PETRI_TRANSITIONS=61} [2025-03-17 14:30:16,646 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 42 predicate places. [2025-03-17 14:30:16,646 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 61 transitions, 448 flow [2025-03-17 14:30:16,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 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-03-17 14:30:16,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:16,646 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-03-17 14:30:16,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:30:16,647 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:16,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:16,647 INFO L85 PathProgramCache]: Analyzing trace with hash 130975077, now seen corresponding path program 8 times [2025-03-17 14:30:16,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:16,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590527802] [2025-03-17 14:30:16,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:30:16,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:16,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-17 14:30:16,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-17 14:30:16,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:30:16,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:16,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:30:16,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:16,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590527802] [2025-03-17 14:30:16,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590527802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:16,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:16,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:30:16,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752076245] [2025-03-17 14:30:16,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:16,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:30:16,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:16,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:30:16,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:30:16,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-17 14:30:16,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 61 transitions, 448 flow. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 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-03-17 14:30:16,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:16,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-17 14:30:16,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:17,137 INFO L124 PetriNetUnfolderBase]: 223/463 cut-off events. [2025-03-17 14:30:17,138 INFO L125 PetriNetUnfolderBase]: For 1701/1709 co-relation queries the response was YES. [2025-03-17 14:30:17,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1853 conditions, 463 events. 223/463 cut-off events. For 1701/1709 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2082 event pairs, 35 based on Foata normal form. 3/466 useless extension candidates. Maximal degree in co-relation 1822. Up to 297 conditions per place. [2025-03-17 14:30:17,141 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 60 selfloop transitions, 23 changer transitions 5/91 dead transitions. [2025-03-17 14:30:17,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 91 transitions, 792 flow [2025-03-17 14:30:17,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:30:17,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:30:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 147 transitions. [2025-03-17 14:30:17,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3769230769230769 [2025-03-17 14:30:17,143 INFO L175 Difference]: Start difference. First operand has 81 places, 61 transitions, 448 flow. Second operand 10 states and 147 transitions. [2025-03-17 14:30:17,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 91 transitions, 792 flow [2025-03-17 14:30:17,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 91 transitions, 738 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-03-17 14:30:17,148 INFO L231 Difference]: Finished difference. Result has 83 places, 64 transitions, 491 flow [2025-03-17 14:30:17,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=491, PETRI_PLACES=83, PETRI_TRANSITIONS=64} [2025-03-17 14:30:17,148 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 44 predicate places. [2025-03-17 14:30:17,148 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 64 transitions, 491 flow [2025-03-17 14:30:17,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 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-03-17 14:30:17,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:17,149 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-03-17 14:30:17,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:30:17,149 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:17,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:17,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1623712475, now seen corresponding path program 9 times [2025-03-17 14:30:17,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:17,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082266683] [2025-03-17 14:30:17,150 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:30:17,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:17,155 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-17 14:30:17,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-17 14:30:17,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:30:17,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:17,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:30:17,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:17,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082266683] [2025-03-17 14:30:17,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082266683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:17,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:17,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:30:17,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724493609] [2025-03-17 14:30:17,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:17,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:30:17,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:17,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:30:17,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:30:17,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-17 14:30:17,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 64 transitions, 491 flow. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 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-03-17 14:30:17,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:17,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-17 14:30:17,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:17,555 INFO L124 PetriNetUnfolderBase]: 219/450 cut-off events. [2025-03-17 14:30:17,555 INFO L125 PetriNetUnfolderBase]: For 2231/2239 co-relation queries the response was YES. [2025-03-17 14:30:17,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1919 conditions, 450 events. 219/450 cut-off events. For 2231/2239 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1998 event pairs, 35 based on Foata normal form. 3/453 useless extension candidates. Maximal degree in co-relation 1890. Up to 301 conditions per place. [2025-03-17 14:30:17,558 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 54 selfloop transitions, 22 changer transitions 8/87 dead transitions. [2025-03-17 14:30:17,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 87 transitions, 797 flow [2025-03-17 14:30:17,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:30:17,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:30:17,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2025-03-17 14:30:17,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3641025641025641 [2025-03-17 14:30:17,560 INFO L175 Difference]: Start difference. First operand has 83 places, 64 transitions, 491 flow. Second operand 10 states and 142 transitions. [2025-03-17 14:30:17,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 87 transitions, 797 flow [2025-03-17 14:30:17,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 87 transitions, 730 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-03-17 14:30:17,566 INFO L231 Difference]: Finished difference. Result has 86 places, 64 transitions, 479 flow [2025-03-17 14:30:17,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=479, PETRI_PLACES=86, PETRI_TRANSITIONS=64} [2025-03-17 14:30:17,568 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 47 predicate places. [2025-03-17 14:30:17,568 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 64 transitions, 479 flow [2025-03-17 14:30:17,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 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-03-17 14:30:17,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:17,568 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-03-17 14:30:17,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:30:17,568 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:17,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:17,569 INFO L85 PathProgramCache]: Analyzing trace with hash -221400613, now seen corresponding path program 10 times [2025-03-17 14:30:17,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:17,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125752147] [2025-03-17 14:30:17,569 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:30:17,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:17,576 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-17 14:30:17,588 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:30:17,588 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:30:17,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:17,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:30:17,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:17,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125752147] [2025-03-17 14:30:17,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125752147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:17,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:17,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:30:17,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464259712] [2025-03-17 14:30:17,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:17,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:30:17,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:17,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:30:17,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:30:17,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-17 14:30:17,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 64 transitions, 479 flow. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 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-03-17 14:30:17,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:17,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-17 14:30:17,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:18,074 INFO L124 PetriNetUnfolderBase]: 260/518 cut-off events. [2025-03-17 14:30:18,075 INFO L125 PetriNetUnfolderBase]: For 2670/2678 co-relation queries the response was YES. [2025-03-17 14:30:18,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2188 conditions, 518 events. 260/518 cut-off events. For 2670/2678 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2252 event pairs, 38 based on Foata normal form. 3/521 useless extension candidates. Maximal degree in co-relation 2154. Up to 339 conditions per place. [2025-03-17 14:30:18,078 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 69 selfloop transitions, 23 changer transitions 5/99 dead transitions. [2025-03-17 14:30:18,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 99 transitions, 881 flow [2025-03-17 14:30:18,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:30:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:30:18,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 145 transitions. [2025-03-17 14:30:18,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3717948717948718 [2025-03-17 14:30:18,079 INFO L175 Difference]: Start difference. First operand has 86 places, 64 transitions, 479 flow. Second operand 10 states and 145 transitions. [2025-03-17 14:30:18,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 99 transitions, 881 flow [2025-03-17 14:30:18,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 99 transitions, 825 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-17 14:30:18,086 INFO L231 Difference]: Finished difference. Result has 89 places, 68 transitions, 546 flow [2025-03-17 14:30:18,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=546, PETRI_PLACES=89, PETRI_TRANSITIONS=68} [2025-03-17 14:30:18,087 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 50 predicate places. [2025-03-17 14:30:18,087 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 68 transitions, 546 flow [2025-03-17 14:30:18,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 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-03-17 14:30:18,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:18,087 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-03-17 14:30:18,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:30:18,088 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:18,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:18,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1976088165, now seen corresponding path program 11 times [2025-03-17 14:30:18,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:18,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038245326] [2025-03-17 14:30:18,088 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:30:18,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:18,093 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-17 14:30:18,103 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:30:18,103 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:30:18,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:18,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:30:18,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:18,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038245326] [2025-03-17 14:30:18,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038245326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:18,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:30:18,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:30:18,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800761989] [2025-03-17 14:30:18,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:18,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:30:18,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:18,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:30:18,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:30:18,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-17 14:30:18,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 68 transitions, 546 flow. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 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-03-17 14:30:18,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:18,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-17 14:30:18,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:18,486 INFO L124 PetriNetUnfolderBase]: 229/468 cut-off events. [2025-03-17 14:30:18,487 INFO L125 PetriNetUnfolderBase]: For 3180/3180 co-relation queries the response was YES. [2025-03-17 14:30:18,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2119 conditions, 468 events. 229/468 cut-off events. For 3180/3180 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2058 event pairs, 41 based on Foata normal form. 1/468 useless extension candidates. Maximal degree in co-relation 2086. Up to 316 conditions per place. [2025-03-17 14:30:18,490 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 58 selfloop transitions, 21 changer transitions 8/90 dead transitions. [2025-03-17 14:30:18,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 90 transitions, 861 flow [2025-03-17 14:30:18,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:30:18,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:30:18,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2025-03-17 14:30:18,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2025-03-17 14:30:18,492 INFO L175 Difference]: Start difference. First operand has 89 places, 68 transitions, 546 flow. Second operand 10 states and 143 transitions. [2025-03-17 14:30:18,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 90 transitions, 861 flow [2025-03-17 14:30:18,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 90 transitions, 784 flow, removed 20 selfloop flow, removed 6 redundant places. [2025-03-17 14:30:18,499 INFO L231 Difference]: Finished difference. Result has 93 places, 68 transitions, 524 flow [2025-03-17 14:30:18,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=524, PETRI_PLACES=93, PETRI_TRANSITIONS=68} [2025-03-17 14:30:18,499 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 54 predicate places. [2025-03-17 14:30:18,499 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 68 transitions, 524 flow [2025-03-17 14:30:18,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 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-03-17 14:30:18,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:18,500 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] [2025-03-17 14:30:18,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 14:30:18,500 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:18,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:18,500 INFO L85 PathProgramCache]: Analyzing trace with hash -975292234, now seen corresponding path program 1 times [2025-03-17 14:30:18,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:18,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12316956] [2025-03-17 14:30:18,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:18,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:18,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:30:18,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:30:18,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:18,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:18,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:30:18,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:18,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12316956] [2025-03-17 14:30:18,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12316956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:18,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832834047] [2025-03-17 14:30:18,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:18,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:18,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:18,604 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:30:18,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:30:18,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:30:18,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:30:18,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:18,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:18,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:30:18,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:30:18,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:18,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:30:18,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832834047] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:30:18,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:30:18,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-03-17 14:30:18,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722117623] [2025-03-17 14:30:18,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:30:18,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:30:18,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:18,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:30:18,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:30:18,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-17 14:30:18,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 68 transitions, 524 flow. Second operand has 14 states, 14 states have (on average 12.428571428571429) internal successors, (174), 14 states have internal predecessors, (174), 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-03-17 14:30:18,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:18,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-17 14:30:18,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:19,060 INFO L124 PetriNetUnfolderBase]: 367/806 cut-off events. [2025-03-17 14:30:19,061 INFO L125 PetriNetUnfolderBase]: For 6085/6085 co-relation queries the response was YES. [2025-03-17 14:30:19,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3731 conditions, 806 events. 367/806 cut-off events. For 6085/6085 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4422 event pairs, 153 based on Foata normal form. 24/829 useless extension candidates. Maximal degree in co-relation 3693. Up to 379 conditions per place. [2025-03-17 14:30:19,067 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 116 selfloop transitions, 8 changer transitions 13/141 dead transitions. [2025-03-17 14:30:19,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 141 transitions, 1393 flow [2025-03-17 14:30:19,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:30:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:30:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2025-03-17 14:30:19,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-17 14:30:19,068 INFO L175 Difference]: Start difference. First operand has 93 places, 68 transitions, 524 flow. Second operand 8 states and 130 transitions. [2025-03-17 14:30:19,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 141 transitions, 1393 flow [2025-03-17 14:30:19,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 141 transitions, 1273 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-03-17 14:30:19,080 INFO L231 Difference]: Finished difference. Result has 95 places, 73 transitions, 556 flow [2025-03-17 14:30:19,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=556, PETRI_PLACES=95, PETRI_TRANSITIONS=73} [2025-03-17 14:30:19,081 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 56 predicate places. [2025-03-17 14:30:19,081 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 73 transitions, 556 flow [2025-03-17 14:30:19,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.428571428571429) internal successors, (174), 14 states have internal predecessors, (174), 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-03-17 14:30:19,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:19,081 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:19,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:30:19,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 14:30:19,282 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:19,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:19,282 INFO L85 PathProgramCache]: Analyzing trace with hash -380716302, now seen corresponding path program 1 times [2025-03-17 14:30:19,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:19,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011130669] [2025-03-17 14:30:19,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:19,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:19,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:30:19,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:30:19,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:19,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:30:19,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:19,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011130669] [2025-03-17 14:30:19,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011130669] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:19,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890041178] [2025-03-17 14:30:19,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:19,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:19,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:19,347 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:30:19,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:30:19,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:30:19,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:30:19,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:19,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:19,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:30:19,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:30:19,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:30:19,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890041178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:30:19,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:30:19,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-17 14:30:19,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529217243] [2025-03-17 14:30:19,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:30:19,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:30:19,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:19,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:30:19,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:30:19,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-17 14:30:19,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 73 transitions, 556 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-03-17 14:30:19,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:19,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-17 14:30:19,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:19,551 INFO L124 PetriNetUnfolderBase]: 340/798 cut-off events. [2025-03-17 14:30:19,551 INFO L125 PetriNetUnfolderBase]: For 7801/7938 co-relation queries the response was YES. [2025-03-17 14:30:19,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3689 conditions, 798 events. 340/798 cut-off events. For 7801/7938 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4414 event pairs, 98 based on Foata normal form. 69/866 useless extension candidates. Maximal degree in co-relation 3612. Up to 322 conditions per place. [2025-03-17 14:30:19,556 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 58 selfloop transitions, 7 changer transitions 27/96 dead transitions. [2025-03-17 14:30:19,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 96 transitions, 903 flow [2025-03-17 14:30:19,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:30:19,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:30:19,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-03-17 14:30:19,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5576923076923077 [2025-03-17 14:30:19,557 INFO L175 Difference]: Start difference. First operand has 95 places, 73 transitions, 556 flow. Second operand 4 states and 87 transitions. [2025-03-17 14:30:19,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 96 transitions, 903 flow [2025-03-17 14:30:19,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 96 transitions, 852 flow, removed 19 selfloop flow, removed 6 redundant places. [2025-03-17 14:30:19,570 INFO L231 Difference]: Finished difference. Result has 94 places, 43 transitions, 330 flow [2025-03-17 14:30:19,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=330, PETRI_PLACES=94, PETRI_TRANSITIONS=43} [2025-03-17 14:30:19,571 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 55 predicate places. [2025-03-17 14:30:19,571 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 43 transitions, 330 flow [2025-03-17 14:30:19,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-03-17 14:30:19,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:19,571 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:19,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:30:19,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:19,776 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:19,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:19,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2062341000, now seen corresponding path program 2 times [2025-03-17 14:30:19,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:19,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910083292] [2025-03-17 14:30:19,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:30:19,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:19,785 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:30:19,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:30:19,797 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:30:19,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:30:20,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:20,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910083292] [2025-03-17 14:30:20,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910083292] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:20,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461389056] [2025-03-17 14:30:20,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:30:20,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:20,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:20,060 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:30:20,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:30:20,101 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-17 14:30:20,120 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:30:20,120 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:30:20,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:20,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 14:30:20,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:30:20,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:20,383 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 14:30:20,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-17 14:30:20,550 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:30:20,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461389056] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:30:20,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:30:20,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-03-17 14:30:20,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36255152] [2025-03-17 14:30:20,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:30:20,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 14:30:20,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:20,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 14:30:20,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2025-03-17 14:30:20,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-17 14:30:20,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 43 transitions, 330 flow. Second operand has 23 states, 23 states have (on average 9.782608695652174) internal successors, (225), 23 states have internal predecessors, (225), 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-03-17 14:30:20,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:20,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-17 14:30:20,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:21,958 INFO L124 PetriNetUnfolderBase]: 1125/2040 cut-off events. [2025-03-17 14:30:21,959 INFO L125 PetriNetUnfolderBase]: For 24843/24843 co-relation queries the response was YES. [2025-03-17 14:30:21,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9893 conditions, 2040 events. 1125/2040 cut-off events. For 24843/24843 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 10605 event pairs, 83 based on Foata normal form. 100/2139 useless extension candidates. Maximal degree in co-relation 9656. Up to 495 conditions per place. [2025-03-17 14:30:21,974 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 220 selfloop transitions, 52 changer transitions 0/274 dead transitions. [2025-03-17 14:30:21,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 274 transitions, 2615 flow [2025-03-17 14:30:21,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 14:30:21,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-17 14:30:21,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 459 transitions. [2025-03-17 14:30:21,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40583554376657827 [2025-03-17 14:30:21,976 INFO L175 Difference]: Start difference. First operand has 94 places, 43 transitions, 330 flow. Second operand 29 states and 459 transitions. [2025-03-17 14:30:21,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 274 transitions, 2615 flow [2025-03-17 14:30:21,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 274 transitions, 1856 flow, removed 365 selfloop flow, removed 20 redundant places. [2025-03-17 14:30:21,995 INFO L231 Difference]: Finished difference. Result has 99 places, 91 transitions, 816 flow [2025-03-17 14:30:21,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=816, PETRI_PLACES=99, PETRI_TRANSITIONS=91} [2025-03-17 14:30:21,996 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 60 predicate places. [2025-03-17 14:30:21,996 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 816 flow [2025-03-17 14:30:21,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.782608695652174) internal successors, (225), 23 states have internal predecessors, (225), 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-03-17 14:30:21,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:21,996 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:22,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 14:30:22,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:22,197 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:22,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:22,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1316978630, now seen corresponding path program 3 times [2025-03-17 14:30:22,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:22,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262130283] [2025-03-17 14:30:22,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:30:22,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:22,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-03-17 14:30:22,219 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 28 statements. [2025-03-17 14:30:22,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:30:22,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:22,290 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 14:30:22,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:22,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262130283] [2025-03-17 14:30:22,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262130283] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:22,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227942855] [2025-03-17 14:30:22,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:30:22,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:22,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:22,293 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:30:22,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:30:22,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-03-17 14:30:22,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 28 statements. [2025-03-17 14:30:22,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:30:22,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:22,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:30:22,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:22,382 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 14:30:22,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:22,404 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 14:30:22,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2025-03-17 14:30:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 14:30:22,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227942855] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:30:22,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:30:22,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2025-03-17 14:30:22,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171863808] [2025-03-17 14:30:22,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:30:22,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:30:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:22,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:30:22,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:30:22,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-03-17 14:30:22,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 816 flow. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 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-03-17 14:30:22,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:22,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-03-17 14:30:22,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:22,758 INFO L124 PetriNetUnfolderBase]: 1590/2835 cut-off events. [2025-03-17 14:30:22,758 INFO L125 PetriNetUnfolderBase]: For 20166/20166 co-relation queries the response was YES. [2025-03-17 14:30:22,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12754 conditions, 2835 events. 1590/2835 cut-off events. For 20166/20166 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 15530 event pairs, 294 based on Foata normal form. 28/2861 useless extension candidates. Maximal degree in co-relation 10548. Up to 1179 conditions per place. [2025-03-17 14:30:22,782 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 118 selfloop transitions, 37 changer transitions 0/157 dead transitions. [2025-03-17 14:30:22,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 157 transitions, 1739 flow [2025-03-17 14:30:22,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:30:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:30:22,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2025-03-17 14:30:22,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2025-03-17 14:30:22,783 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 816 flow. Second operand 6 states and 96 transitions. [2025-03-17 14:30:22,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 157 transitions, 1739 flow [2025-03-17 14:30:22,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 157 transitions, 1546 flow, removed 93 selfloop flow, removed 3 redundant places. [2025-03-17 14:30:22,821 INFO L231 Difference]: Finished difference. Result has 103 places, 103 transitions, 938 flow [2025-03-17 14:30:22,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=938, PETRI_PLACES=103, PETRI_TRANSITIONS=103} [2025-03-17 14:30:22,822 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 64 predicate places. [2025-03-17 14:30:22,822 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 103 transitions, 938 flow [2025-03-17 14:30:22,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 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-03-17 14:30:22,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:22,823 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:22,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 14:30:23,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:23,025 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:23,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:23,027 INFO L85 PathProgramCache]: Analyzing trace with hash -2095392797, now seen corresponding path program 1 times [2025-03-17 14:30:23,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:23,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685581561] [2025-03-17 14:30:23,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:23,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:23,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 14:30:23,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:30:23,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:23,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:23,786 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:30:23,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:23,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685581561] [2025-03-17 14:30:23,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685581561] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:23,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206223008] [2025-03-17 14:30:23,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:30:23,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:23,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:23,789 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:30:23,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:30:23,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 14:30:23,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:30:23,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:30:23,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:23,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 14:30:23,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:24,594 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:30:24,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:25,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:30:25,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 34 [2025-03-17 14:30:25,724 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:30:25,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206223008] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:30:25,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:30:25,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 51 [2025-03-17 14:30:25,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839832974] [2025-03-17 14:30:25,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:30:25,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-17 14:30:25,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:25,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-17 14:30:25,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=2384, Unknown=0, NotChecked=0, Total=2652 [2025-03-17 14:30:25,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-03-17 14:30:25,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 103 transitions, 938 flow. Second operand has 52 states, 52 states have (on average 7.615384615384615) internal successors, (396), 52 states have internal predecessors, (396), 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-03-17 14:30:25,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:25,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-03-17 14:30:25,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:30,017 INFO L124 PetriNetUnfolderBase]: 2943/5067 cut-off events. [2025-03-17 14:30:30,017 INFO L125 PetriNetUnfolderBase]: For 34784/34784 co-relation queries the response was YES. [2025-03-17 14:30:30,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23616 conditions, 5067 events. 2943/5067 cut-off events. For 34784/34784 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 29898 event pairs, 367 based on Foata normal form. 3/5070 useless extension candidates. Maximal degree in co-relation 20151. Up to 3094 conditions per place. [2025-03-17 14:30:30,047 INFO L140 encePairwiseOnDemand]: 23/39 looper letters, 207 selfloop transitions, 196 changer transitions 10/414 dead transitions. [2025-03-17 14:30:30,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 414 transitions, 4289 flow [2025-03-17 14:30:30,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-17 14:30:30,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-17 14:30:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 489 transitions. [2025-03-17 14:30:30,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2725752508361204 [2025-03-17 14:30:30,049 INFO L175 Difference]: Start difference. First operand has 103 places, 103 transitions, 938 flow. Second operand 46 states and 489 transitions. [2025-03-17 14:30:30,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 414 transitions, 4289 flow [2025-03-17 14:30:30,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 414 transitions, 4238 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-17 14:30:30,110 INFO L231 Difference]: Finished difference. Result has 159 places, 287 transitions, 3514 flow [2025-03-17 14:30:30,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=3514, PETRI_PLACES=159, PETRI_TRANSITIONS=287} [2025-03-17 14:30:30,110 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 120 predicate places. [2025-03-17 14:30:30,111 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 287 transitions, 3514 flow [2025-03-17 14:30:30,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 7.615384615384615) internal successors, (396), 52 states have internal predecessors, (396), 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-03-17 14:30:30,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:30,111 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:30,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 14:30:30,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:30,312 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:30,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:30,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1185301889, now seen corresponding path program 2 times [2025-03-17 14:30:30,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:30,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021459201] [2025-03-17 14:30:30,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:30:30,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:30,317 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-17 14:30:30,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:30:30,332 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:30:30,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:31,141 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:30:31,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:31,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021459201] [2025-03-17 14:30:31,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021459201] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:31,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011833765] [2025-03-17 14:30:31,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:30:31,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:31,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:31,144 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:30:31,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:30:31,191 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-17 14:30:31,252 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:30:31,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:30:31,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:31,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 14:30:31,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:31,748 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 14:30:31,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2025-03-17 14:30:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:30:31,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:32,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:30:32,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2025-03-17 14:30:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:30:32,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011833765] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:30:32,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:30:32,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 50 [2025-03-17 14:30:32,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28613330] [2025-03-17 14:30:32,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:30:32,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-17 14:30:32,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:32,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-17 14:30:32,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2345, Unknown=0, NotChecked=0, Total=2550 [2025-03-17 14:30:33,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-03-17 14:30:33,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 287 transitions, 3514 flow. Second operand has 51 states, 51 states have (on average 7.647058823529412) internal successors, (390), 51 states have internal predecessors, (390), 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-03-17 14:30:33,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:33,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-03-17 14:30:33,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:37,813 INFO L124 PetriNetUnfolderBase]: 3188/5525 cut-off events. [2025-03-17 14:30:37,813 INFO L125 PetriNetUnfolderBase]: For 48751/48751 co-relation queries the response was YES. [2025-03-17 14:30:37,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31523 conditions, 5525 events. 3188/5525 cut-off events. For 48751/48751 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 33566 event pairs, 252 based on Foata normal form. 3/5528 useless extension candidates. Maximal degree in co-relation 31445. Up to 3058 conditions per place. [2025-03-17 14:30:37,846 INFO L140 encePairwiseOnDemand]: 23/39 looper letters, 258 selfloop transitions, 297 changer transitions 10/566 dead transitions. [2025-03-17 14:30:37,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 566 transitions, 6803 flow [2025-03-17 14:30:37,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-17 14:30:37,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-03-17 14:30:37,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 561 transitions. [2025-03-17 14:30:37,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2876923076923077 [2025-03-17 14:30:37,848 INFO L175 Difference]: Start difference. First operand has 159 places, 287 transitions, 3514 flow. Second operand 50 states and 561 transitions. [2025-03-17 14:30:37,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 566 transitions, 6803 flow [2025-03-17 14:30:37,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 566 transitions, 6488 flow, removed 154 selfloop flow, removed 5 redundant places. [2025-03-17 14:30:38,003 INFO L231 Difference]: Finished difference. Result has 217 places, 396 transitions, 5522 flow [2025-03-17 14:30:38,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3231, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=196, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=5522, PETRI_PLACES=217, PETRI_TRANSITIONS=396} [2025-03-17 14:30:38,004 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 178 predicate places. [2025-03-17 14:30:38,004 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 396 transitions, 5522 flow [2025-03-17 14:30:38,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 7.647058823529412) internal successors, (390), 51 states have internal predecessors, (390), 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-03-17 14:30:38,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:38,004 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:38,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 14:30:38,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:38,205 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:38,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:38,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1288086313, now seen corresponding path program 3 times [2025-03-17 14:30:38,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:38,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497604546] [2025-03-17 14:30:38,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:30:38,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:38,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-03-17 14:30:38,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 29 statements. [2025-03-17 14:30:38,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:30:38,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:30:38,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:38,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497604546] [2025-03-17 14:30:38,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497604546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:38,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761277983] [2025-03-17 14:30:38,623 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:30:38,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:38,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:38,625 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:30:38,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 14:30:38,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-03-17 14:30:38,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 29 statements. [2025-03-17 14:30:38,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:30:38,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:38,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 14:30:38,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:38,919 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:30:38,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:39,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:30:39,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 35 [2025-03-17 14:30:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:30:39,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761277983] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:30:39,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:30:39,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 31 [2025-03-17 14:30:39,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562512978] [2025-03-17 14:30:39,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:30:39,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 14:30:39,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:39,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 14:30:39,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2025-03-17 14:30:39,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-03-17 14:30:39,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 396 transitions, 5522 flow. Second operand has 32 states, 32 states have (on average 7.875) internal successors, (252), 32 states have internal predecessors, (252), 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-03-17 14:30:39,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:39,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-03-17 14:30:39,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:41,109 INFO L124 PetriNetUnfolderBase]: 3307/5739 cut-off events. [2025-03-17 14:30:41,109 INFO L125 PetriNetUnfolderBase]: For 70175/70175 co-relation queries the response was YES. [2025-03-17 14:30:41,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38304 conditions, 5739 events. 3307/5739 cut-off events. For 70175/70175 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 35018 event pairs, 211 based on Foata normal form. 2/5741 useless extension candidates. Maximal degree in co-relation 38212. Up to 3143 conditions per place. [2025-03-17 14:30:41,158 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 299 selfloop transitions, 294 changer transitions 5/599 dead transitions. [2025-03-17 14:30:41,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 599 transitions, 8808 flow [2025-03-17 14:30:41,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 14:30:41,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-17 14:30:41,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 269 transitions. [2025-03-17 14:30:41,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3135198135198135 [2025-03-17 14:30:41,162 INFO L175 Difference]: Start difference. First operand has 217 places, 396 transitions, 5522 flow. Second operand 22 states and 269 transitions. [2025-03-17 14:30:41,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 599 transitions, 8808 flow [2025-03-17 14:30:41,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 599 transitions, 8330 flow, removed 219 selfloop flow, removed 9 redundant places. [2025-03-17 14:30:41,452 INFO L231 Difference]: Finished difference. Result has 235 places, 486 transitions, 7356 flow [2025-03-17 14:30:41,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=5156, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=7356, PETRI_PLACES=235, PETRI_TRANSITIONS=486} [2025-03-17 14:30:41,453 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 196 predicate places. [2025-03-17 14:30:41,453 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 486 transitions, 7356 flow [2025-03-17 14:30:41,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.875) internal successors, (252), 32 states have internal predecessors, (252), 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-03-17 14:30:41,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:41,453 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:41,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 14:30:41,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-17 14:30:41,654 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:41,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:41,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1167258455, now seen corresponding path program 4 times [2025-03-17 14:30:41,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:41,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549734773] [2025-03-17 14:30:41,654 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:30:41,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:41,660 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-17 14:30:41,677 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:30:41,677 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:30:41,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:42,005 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:30:42,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:42,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549734773] [2025-03-17 14:30:42,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549734773] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:42,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461172435] [2025-03-17 14:30:42,005 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:30:42,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:42,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:42,007 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:30:42,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 14:30:42,045 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-17 14:30:42,064 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:30:42,065 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:30:42,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:42,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-17 14:30:42,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:42,684 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:30:42,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:43,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:30:43,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2025-03-17 14:30:43,497 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:30:43,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461172435] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:30:43,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:30:43,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 17] total 46 [2025-03-17 14:30:43,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418435551] [2025-03-17 14:30:43,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:30:43,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-17 14:30:43,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:43,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-17 14:30:43,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1929, Unknown=0, NotChecked=0, Total=2162 [2025-03-17 14:30:43,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-03-17 14:30:43,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 486 transitions, 7356 flow. Second operand has 47 states, 47 states have (on average 7.74468085106383) internal successors, (364), 47 states have internal predecessors, (364), 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-03-17 14:30:43,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:43,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-03-17 14:30:43,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:30:47,842 INFO L124 PetriNetUnfolderBase]: 3404/5982 cut-off events. [2025-03-17 14:30:47,842 INFO L125 PetriNetUnfolderBase]: For 79567/79567 co-relation queries the response was YES. [2025-03-17 14:30:47,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43595 conditions, 5982 events. 3404/5982 cut-off events. For 79567/79567 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 37715 event pairs, 256 based on Foata normal form. 4/5986 useless extension candidates. Maximal degree in co-relation 43503. Up to 3183 conditions per place. [2025-03-17 14:30:47,895 INFO L140 encePairwiseOnDemand]: 23/39 looper letters, 307 selfloop transitions, 419 changer transitions 15/742 dead transitions. [2025-03-17 14:30:47,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 742 transitions, 10778 flow [2025-03-17 14:30:47,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-17 14:30:47,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2025-03-17 14:30:47,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 695 transitions. [2025-03-17 14:30:47,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2921395544346364 [2025-03-17 14:30:47,897 INFO L175 Difference]: Start difference. First operand has 235 places, 486 transitions, 7356 flow. Second operand 61 states and 695 transitions. [2025-03-17 14:30:47,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 742 transitions, 10778 flow [2025-03-17 14:30:48,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 742 transitions, 10467 flow, removed 149 selfloop flow, removed 3 redundant places. [2025-03-17 14:30:48,367 INFO L231 Difference]: Finished difference. Result has 303 places, 533 transitions, 9101 flow [2025-03-17 14:30:48,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=7175, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=378, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=9101, PETRI_PLACES=303, PETRI_TRANSITIONS=533} [2025-03-17 14:30:48,368 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 264 predicate places. [2025-03-17 14:30:48,368 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 533 transitions, 9101 flow [2025-03-17 14:30:48,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 7.74468085106383) internal successors, (364), 47 states have internal predecessors, (364), 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-03-17 14:30:48,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:30:48,368 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:30:48,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 14:30:48,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-17 14:30:48,569 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:30:48,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:30:48,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1536770819, now seen corresponding path program 5 times [2025-03-17 14:30:48,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:30:48,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773342305] [2025-03-17 14:30:48,569 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:30:48,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:30:48,573 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 3 equivalence classes. [2025-03-17 14:30:48,585 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:30:48,585 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 14:30:48,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:30:49,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:30:49,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773342305] [2025-03-17 14:30:49,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773342305] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:30:49,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032022710] [2025-03-17 14:30:49,460 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:30:49,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:30:49,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:30:49,462 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:30:49,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 14:30:49,504 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 3 equivalence classes. [2025-03-17 14:30:49,568 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:30:49,568 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 14:30:49,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:30:49,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-17 14:30:49,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:30:50,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:30:50,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:30:50,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:30:50,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 24 [2025-03-17 14:30:51,294 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:30:51,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032022710] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:30:51,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:30:51,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 50 [2025-03-17 14:30:51,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99105814] [2025-03-17 14:30:51,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:30:51,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-17 14:30:51,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:30:51,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-17 14:30:51,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2340, Unknown=0, NotChecked=0, Total=2550 [2025-03-17 14:30:51,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-03-17 14:30:51,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 533 transitions, 9101 flow. Second operand has 51 states, 51 states have (on average 7.647058823529412) internal successors, (390), 51 states have internal predecessors, (390), 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-03-17 14:30:51,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:30:51,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-03-17 14:30:51,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:31:01,986 INFO L124 PetriNetUnfolderBase]: 4009/7173 cut-off events. [2025-03-17 14:31:01,986 INFO L125 PetriNetUnfolderBase]: For 110379/110379 co-relation queries the response was YES. [2025-03-17 14:31:02,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56563 conditions, 7173 events. 4009/7173 cut-off events. For 110379/110379 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 48321 event pairs, 264 based on Foata normal form. 8/7181 useless extension candidates. Maximal degree in co-relation 56430. Up to 3432 conditions per place. [2025-03-17 14:31:02,033 INFO L140 encePairwiseOnDemand]: 23/39 looper letters, 412 selfloop transitions, 617 changer transitions 56/1086 dead transitions. [2025-03-17 14:31:02,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 1086 transitions, 17750 flow [2025-03-17 14:31:02,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2025-03-17 14:31:02,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2025-03-17 14:31:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 1278 transitions. [2025-03-17 14:31:02,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27537168713639304 [2025-03-17 14:31:02,036 INFO L175 Difference]: Start difference. First operand has 303 places, 533 transitions, 9101 flow. Second operand 119 states and 1278 transitions. [2025-03-17 14:31:02,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 1086 transitions, 17750 flow [2025-03-17 14:31:02,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 1086 transitions, 17170 flow, removed 128 selfloop flow, removed 30 redundant places. [2025-03-17 14:31:02,547 INFO L231 Difference]: Finished difference. Result has 414 places, 776 transitions, 14873 flow [2025-03-17 14:31:02,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=8553, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=412, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=119, PETRI_FLOW=14873, PETRI_PLACES=414, PETRI_TRANSITIONS=776} [2025-03-17 14:31:02,547 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 375 predicate places. [2025-03-17 14:31:02,547 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 776 transitions, 14873 flow [2025-03-17 14:31:02,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 7.647058823529412) internal successors, (390), 51 states have internal predecessors, (390), 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-03-17 14:31:02,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:31:02,548 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:31:02,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 14:31:02,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 14:31:02,748 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:31:02,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:31:02,749 INFO L85 PathProgramCache]: Analyzing trace with hash -23905267, now seen corresponding path program 6 times [2025-03-17 14:31:02,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:31:02,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849885780] [2025-03-17 14:31:02,749 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:31:02,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:31:02,753 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-03-17 14:31:02,764 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:31:02,764 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-17 14:31:02,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:31:03,368 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:31:03,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:31:03,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849885780] [2025-03-17 14:31:03,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849885780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:31:03,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379792821] [2025-03-17 14:31:03,368 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:31:03,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:31:03,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:31:03,370 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:31:03,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 14:31:03,411 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-03-17 14:31:03,472 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:31:03,472 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-17 14:31:03,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:31:03,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 14:31:03,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:31:03,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-17 14:31:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:31:04,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:31:04,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:31:04,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 24 [2025-03-17 14:31:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:31:04,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379792821] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:31:04,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:31:04,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 17] total 51 [2025-03-17 14:31:04,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725904070] [2025-03-17 14:31:04,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:31:04,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-17 14:31:04,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:31:04,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-17 14:31:04,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=2351, Unknown=0, NotChecked=0, Total=2652 [2025-03-17 14:31:05,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-03-17 14:31:05,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 776 transitions, 14873 flow. Second operand has 52 states, 52 states have (on average 7.615384615384615) internal successors, (396), 52 states have internal predecessors, (396), 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-03-17 14:31:05,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:31:05,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-03-17 14:31:05,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:31:14,092 INFO L124 PetriNetUnfolderBase]: 5750/10313 cut-off events. [2025-03-17 14:31:14,092 INFO L125 PetriNetUnfolderBase]: For 250494/250494 co-relation queries the response was YES. [2025-03-17 14:31:14,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88673 conditions, 10313 events. 5750/10313 cut-off events. For 250494/250494 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 73604 event pairs, 367 based on Foata normal form. 10/10323 useless extension candidates. Maximal degree in co-relation 88310. Up to 3429 conditions per place. [2025-03-17 14:31:14,189 INFO L140 encePairwiseOnDemand]: 22/39 looper letters, 677 selfloop transitions, 794 changer transitions 59/1531 dead transitions. [2025-03-17 14:31:14,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 1531 transitions, 29637 flow [2025-03-17 14:31:14,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-03-17 14:31:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2025-03-17 14:31:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 1079 transitions. [2025-03-17 14:31:14,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32170542635658916 [2025-03-17 14:31:14,190 INFO L175 Difference]: Start difference. First operand has 414 places, 776 transitions, 14873 flow. Second operand 86 states and 1079 transitions. [2025-03-17 14:31:14,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 1531 transitions, 29637 flow [2025-03-17 14:31:15,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 1531 transitions, 27611 flow, removed 860 selfloop flow, removed 35 redundant places. [2025-03-17 14:31:15,839 INFO L231 Difference]: Finished difference. Result has 498 places, 1139 transitions, 23868 flow [2025-03-17 14:31:15,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=13522, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=776, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=466, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=86, PETRI_FLOW=23868, PETRI_PLACES=498, PETRI_TRANSITIONS=1139} [2025-03-17 14:31:15,840 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 459 predicate places. [2025-03-17 14:31:15,840 INFO L471 AbstractCegarLoop]: Abstraction has has 498 places, 1139 transitions, 23868 flow [2025-03-17 14:31:15,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 7.615384615384615) internal successors, (396), 52 states have internal predecessors, (396), 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-03-17 14:31:15,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:31:15,841 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:31:15,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 14:31:16,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-17 14:31:16,042 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:31:16,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:31:16,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1778592819, now seen corresponding path program 7 times [2025-03-17 14:31:16,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:31:16,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057777792] [2025-03-17 14:31:16,043 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:31:16,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:31:16,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 14:31:16,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:31:16,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:31:16,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:31:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:31:16,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:31:16,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057777792] [2025-03-17 14:31:16,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057777792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:31:16,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906730334] [2025-03-17 14:31:16,612 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:31:16,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:31:16,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:31:16,614 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:31:16,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 14:31:16,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 14:31:16,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:31:16,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:31:16,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:31:16,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 14:31:16,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:31:17,243 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:31:17,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:31:17,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:31:17,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 24 [2025-03-17 14:31:18,186 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:31:18,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906730334] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:31:18,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:31:18,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 50 [2025-03-17 14:31:18,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294557729] [2025-03-17 14:31:18,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:31:18,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-17 14:31:18,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:31:18,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-17 14:31:18,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=2298, Unknown=0, NotChecked=0, Total=2550 [2025-03-17 14:31:18,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-03-17 14:31:18,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 1139 transitions, 23868 flow. Second operand has 51 states, 51 states have (on average 7.647058823529412) internal successors, (390), 51 states have internal predecessors, (390), 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-03-17 14:31:18,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:31:18,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-03-17 14:31:18,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:31:23,897 INFO L124 PetriNetUnfolderBase]: 5693/10220 cut-off events. [2025-03-17 14:31:23,897 INFO L125 PetriNetUnfolderBase]: For 367900/367900 co-relation queries the response was YES. [2025-03-17 14:31:23,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99227 conditions, 10220 events. 5693/10220 cut-off events. For 367900/367900 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 72730 event pairs, 539 based on Foata normal form. 4/10224 useless extension candidates. Maximal degree in co-relation 98834. Up to 6352 conditions per place. [2025-03-17 14:31:24,027 INFO L140 encePairwiseOnDemand]: 23/39 looper letters, 577 selfloop transitions, 712 changer transitions 17/1307 dead transitions. [2025-03-17 14:31:24,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 1307 transitions, 28017 flow [2025-03-17 14:31:24,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-17 14:31:24,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-17 14:31:24,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 517 transitions. [2025-03-17 14:31:24,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2945868945868946 [2025-03-17 14:31:24,029 INFO L175 Difference]: Start difference. First operand has 498 places, 1139 transitions, 23868 flow. Second operand 45 states and 517 transitions. [2025-03-17 14:31:24,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 1307 transitions, 28017 flow [2025-03-17 14:31:27,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 508 places, 1307 transitions, 26516 flow, removed 691 selfloop flow, removed 23 redundant places. [2025-03-17 14:31:27,208 INFO L231 Difference]: Finished difference. Result has 514 places, 1146 transitions, 24844 flow [2025-03-17 14:31:27,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=22454, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=703, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=24844, PETRI_PLACES=514, PETRI_TRANSITIONS=1146} [2025-03-17 14:31:27,209 INFO L279 CegarLoopForPetriNet]: 39 programPoint places, 475 predicate places. [2025-03-17 14:31:27,209 INFO L471 AbstractCegarLoop]: Abstraction has has 514 places, 1146 transitions, 24844 flow [2025-03-17 14:31:27,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 7.647058823529412) internal successors, (390), 51 states have internal predecessors, (390), 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-03-17 14:31:27,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:31:27,210 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:31:27,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 14:31:27,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-17 14:31:27,410 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-17 14:31:27,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:31:27,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1727624803, now seen corresponding path program 8 times [2025-03-17 14:31:27,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:31:27,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163251398] [2025-03-17 14:31:27,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:31:27,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:31:27,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-17 14:31:27,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:31:27,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:31:27,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:31:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:31:27,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:31:27,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163251398] [2025-03-17 14:31:27,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163251398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:31:27,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864271921] [2025-03-17 14:31:27,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:31:27,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:31:27,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:31:27,962 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:31:27,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 14:31:28,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-17 14:31:28,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:31:28,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:31:28,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:31:28,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 14:31:28,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:31:28,555 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:31:28,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:31:28,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:31:28,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2025-03-17 14:31:29,337 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:31:29,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864271921] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:31:29,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:31:29,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 50 [2025-03-17 14:31:29,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773471350] [2025-03-17 14:31:29,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:31:29,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-17 14:31:29,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:31:29,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-17 14:31:29,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2338, Unknown=0, NotChecked=0, Total=2550 [2025-03-17 14:31:29,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-03-17 14:31:29,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 1146 transitions, 24844 flow. Second operand has 51 states, 51 states have (on average 7.647058823529412) internal successors, (390), 51 states have internal predecessors, (390), 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-03-17 14:31:29,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:31:29,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-03-17 14:31:29,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand