./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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-array-sum-alt.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 cd36b7f18dbd530fce94e0943ff58c16da276fcc41b96fdafde87c3c69036175 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:25:28,576 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:25:28,636 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:25:28,641 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:25:28,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:25:28,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:25:28,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:25:28,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:25:28,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:25:28,665 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:25:28,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:25:28,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:25:28,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:25:28,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:25:28,666 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:25:28,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:25:28,666 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:25:28,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:25:28,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:25:28,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:25:28,667 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:25:28,667 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:25:28,667 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:25:28,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:25:28,667 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:25:28,667 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:25:28,667 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:25:28,667 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:25:28,667 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:25:28,668 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:25:28,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:25:28,668 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:25:28,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:25:28,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:25:28,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:25:28,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:25:28,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:25:28,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:25:28,669 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:25:28,669 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:25:28,669 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:25:28,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:25:28,669 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 -> cd36b7f18dbd530fce94e0943ff58c16da276fcc41b96fdafde87c3c69036175 [2025-03-09 01:25:28,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:25:28,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:25:28,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:25:28,882 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:25:28,882 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:25:28,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c [2025-03-09 01:25:29,989 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87fba2b2/d09f45a271dc44b8a2782c58769a4276/FLAGa2cc02993 [2025-03-09 01:25:30,267 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:25:30,269 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c [2025-03-09 01:25:30,275 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87fba2b2/d09f45a271dc44b8a2782c58769a4276/FLAGa2cc02993 [2025-03-09 01:25:30,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87fba2b2/d09f45a271dc44b8a2782c58769a4276 [2025-03-09 01:25:30,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:25:30,573 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:25:30,574 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:25:30,574 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:25:30,577 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:25:30,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:25:30" (1/1) ... [2025-03-09 01:25:30,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b94d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:30, skipping insertion in model container [2025-03-09 01:25:30,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:25:30" (1/1) ... [2025-03-09 01:25:30,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:25:30,714 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-09 01:25:30,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:25:30,730 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:25:30,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:25:30,764 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:25:30,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:30 WrapperNode [2025-03-09 01:25:30,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:25:30,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:25:30,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:25:30,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:25:30,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:30" (1/1) ... [2025-03-09 01:25:30,782 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:30" (1/1) ... [2025-03-09 01:25:30,805 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 174 [2025-03-09 01:25:30,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:25:30,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:25:30,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:25:30,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:25:30,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:30" (1/1) ... [2025-03-09 01:25:30,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:30" (1/1) ... [2025-03-09 01:25:30,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:30" (1/1) ... [2025-03-09 01:25:30,824 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-09 01:25:30,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:30" (1/1) ... [2025-03-09 01:25:30,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:30" (1/1) ... [2025-03-09 01:25:30,830 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:30" (1/1) ... [2025-03-09 01:25:30,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:30" (1/1) ... [2025-03-09 01:25:30,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:30" (1/1) ... [2025-03-09 01:25:30,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:30" (1/1) ... [2025-03-09 01:25:30,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:25:30,834 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:25:30,835 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:25:30,835 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:25:30,835 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:30" (1/1) ... [2025-03-09 01:25:30,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:25:30,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:25:30,862 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-09 01:25:30,864 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-09 01:25:30,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:25:30,882 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:25:30,882 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:25:30,882 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:25:30,882 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:25:30,882 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:25:30,882 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:25:30,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:25:30,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:25:30,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:25:30,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:25:30,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:25:30,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:25:30,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:25:30,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:25:30,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:25:30,884 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:25:30,976 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:25:30,977 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:25:31,278 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:25:31,278 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:25:31,493 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:25:31,494 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:25:31,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:25:31 BoogieIcfgContainer [2025-03-09 01:25:31,494 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:25:31,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:25:31,497 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:25:31,513 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:25:31,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:25:30" (1/3) ... [2025-03-09 01:25:31,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70636136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:25:31, skipping insertion in model container [2025-03-09 01:25:31,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:25:30" (2/3) ... [2025-03-09 01:25:31,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70636136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:25:31, skipping insertion in model container [2025-03-09 01:25:31,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:25:31" (3/3) ... [2025-03-09 01:25:31,515 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2025-03-09 01:25:31,530 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:25:31,531 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum-alt.wvr.c that has 4 procedures, 42 locations, 1 initial locations, 4 loop locations, and 10 error locations. [2025-03-09 01:25:31,532 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:25:31,584 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 01:25:31,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 45 transitions, 111 flow [2025-03-09 01:25:31,634 INFO L124 PetriNetUnfolderBase]: 4/42 cut-off events. [2025-03-09 01:25:31,635 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:25:31,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 42 events. 4/42 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 77 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2025-03-09 01:25:31,643 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 45 transitions, 111 flow [2025-03-09 01:25:31,645 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 41 transitions, 100 flow [2025-03-09 01:25:31,653 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:25:31,661 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;@767921, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:25:31,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-09 01:25:31,663 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:25:31,664 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:25:31,664 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:25:31,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:31,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:25:31,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:25:31,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:31,668 INFO L85 PathProgramCache]: Analyzing trace with hash 506466, now seen corresponding path program 1 times [2025-03-09 01:25:31,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:31,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77261385] [2025-03-09 01:25:31,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:31,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:31,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:25:31,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:25:31,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:31,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:31,823 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-09 01:25:31,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:31,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77261385] [2025-03-09 01:25:31,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77261385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:25:31,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:25:31,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:25:31,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840484913] [2025-03-09 01:25:31,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:25:31,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:25:31,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:31,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:25:31,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:25:31,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-03-09 01:25:31,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-09 01:25:31,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:31,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-03-09 01:25:31,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:32,036 INFO L124 PetriNetUnfolderBase]: 498/814 cut-off events. [2025-03-09 01:25:32,036 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-03-09 01:25:32,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1607 conditions, 814 events. 498/814 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3428 event pairs, 358 based on Foata normal form. 1/779 useless extension candidates. Maximal degree in co-relation 1383. Up to 717 conditions per place. [2025-03-09 01:25:32,046 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 25 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2025-03-09 01:25:32,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 148 flow [2025-03-09 01:25:32,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:25:32,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:25:32,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2025-03-09 01:25:32,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5481481481481482 [2025-03-09 01:25:32,058 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 100 flow. Second operand 3 states and 74 transitions. [2025-03-09 01:25:32,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 148 flow [2025-03-09 01:25:32,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 136 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:25:32,065 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 86 flow [2025-03-09 01:25:32,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2025-03-09 01:25:32,070 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -7 predicate places. [2025-03-09 01:25:32,071 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 86 flow [2025-03-09 01:25:32,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-09 01:25:32,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:32,071 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:25:32,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:25:32,071 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:25:32,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:32,072 INFO L85 PathProgramCache]: Analyzing trace with hash 506467, now seen corresponding path program 1 times [2025-03-09 01:25:32,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:32,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667479736] [2025-03-09 01:25:32,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:32,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:32,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:25:32,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:25:32,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:32,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:32,290 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-09 01:25:32,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:32,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667479736] [2025-03-09 01:25:32,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667479736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:25:32,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:25:32,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:25:32,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634670135] [2025-03-09 01:25:32,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:25:32,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:25:32,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:32,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:25:32,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:25:32,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-03-09 01:25:32,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:25:32,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:32,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-03-09 01:25:32,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:32,451 INFO L124 PetriNetUnfolderBase]: 499/817 cut-off events. [2025-03-09 01:25:32,451 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-09 01:25:32,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1565 conditions, 817 events. 499/817 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3440 event pairs, 358 based on Foata normal form. 0/781 useless extension candidates. Maximal degree in co-relation 1543. Up to 722 conditions per place. [2025-03-09 01:25:32,459 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 27 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2025-03-09 01:25:32,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 156 flow [2025-03-09 01:25:32,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:25:32,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:25:32,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-03-09 01:25:32,460 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2025-03-09 01:25:32,460 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 86 flow. Second operand 4 states and 92 transitions. [2025-03-09 01:25:32,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 156 flow [2025-03-09 01:25:32,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:25:32,462 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 109 flow [2025-03-09 01:25:32,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2025-03-09 01:25:32,462 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2025-03-09 01:25:32,462 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 109 flow [2025-03-09 01:25:32,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:25:32,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:32,463 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:25:32,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:25:32,463 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:25:32,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:32,464 INFO L85 PathProgramCache]: Analyzing trace with hash 486731144, now seen corresponding path program 1 times [2025-03-09 01:25:32,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:32,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645510792] [2025-03-09 01:25:32,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:32,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:32,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:25:32,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:25:32,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:32,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:32,729 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-09 01:25:32,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:32,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645510792] [2025-03-09 01:25:32,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645510792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:25:32,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913886006] [2025-03-09 01:25:32,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:32,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:25:32,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:25:32,732 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-09 01:25:32,733 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-09 01:25:32,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:25:32,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:25:32,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:32,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:32,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:25:32,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:25:32,835 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-09 01:25:32,998 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-09 01:25:32,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:25:33,086 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-09 01:25:33,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913886006] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:25:33,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:25:33,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:25:33,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091017070] [2025-03-09 01:25:33,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:25:33,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:25:33,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:33,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:25:33,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:25:33,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-03-09 01:25:33,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 109 flow. Second operand has 11 states, 11 states have (on average 16.363636363636363) internal successors, (180), 11 states have internal predecessors, (180), 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-09 01:25:33,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:33,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-03-09 01:25:33,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:33,488 INFO L124 PetriNetUnfolderBase]: 500/819 cut-off events. [2025-03-09 01:25:33,488 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-09 01:25:33,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1581 conditions, 819 events. 500/819 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3443 event pairs, 358 based on Foata normal form. 0/782 useless extension candidates. Maximal degree in co-relation 1550. Up to 719 conditions per place. [2025-03-09 01:25:33,492 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 23 selfloop transitions, 10 changer transitions 0/43 dead transitions. [2025-03-09 01:25:33,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 43 transitions, 183 flow [2025-03-09 01:25:33,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:25:33,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:25:33,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2025-03-09 01:25:33,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2025-03-09 01:25:33,494 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 109 flow. Second operand 8 states and 155 transitions. [2025-03-09 01:25:33,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 43 transitions, 183 flow [2025-03-09 01:25:33,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 43 transitions, 180 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:25:33,495 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 134 flow [2025-03-09 01:25:33,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=134, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2025-03-09 01:25:33,496 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 1 predicate places. [2025-03-09 01:25:33,496 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 134 flow [2025-03-09 01:25:33,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.363636363636363) internal successors, (180), 11 states have internal predecessors, (180), 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-09 01:25:33,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:33,496 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:25:33,502 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-09 01:25:33,701 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-09 01:25:33,701 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:25:33,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:33,701 INFO L85 PathProgramCache]: Analyzing trace with hash -2088885590, now seen corresponding path program 1 times [2025-03-09 01:25:33,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:33,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268162598] [2025-03-09 01:25:33,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:33,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:33,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:25:33,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:25:33,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:33,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:33,766 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-09 01:25:33,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:33,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268162598] [2025-03-09 01:25:33,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268162598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:25:33,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:25:33,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:25:33,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940099394] [2025-03-09 01:25:33,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:25:33,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:25:33,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:33,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:25:33,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:25:33,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45 [2025-03-09 01:25:33,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-09 01:25:33,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:33,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45 [2025-03-09 01:25:33,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:33,901 INFO L124 PetriNetUnfolderBase]: 500/788 cut-off events. [2025-03-09 01:25:33,901 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-09 01:25:33,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 788 events. 500/788 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3076 event pairs, 358 based on Foata normal form. 0/782 useless extension candidates. Maximal degree in co-relation 1520. Up to 718 conditions per place. [2025-03-09 01:25:33,905 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 29 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2025-03-09 01:25:33,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 40 transitions, 194 flow [2025-03-09 01:25:33,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:25:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:25:33,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-03-09 01:25:33,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2025-03-09 01:25:33,906 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 134 flow. Second operand 4 states and 78 transitions. [2025-03-09 01:25:33,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 40 transitions, 194 flow [2025-03-09 01:25:33,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 152 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-09 01:25:33,907 INFO L231 Difference]: Finished difference. Result has 41 places, 40 transitions, 94 flow [2025-03-09 01:25:33,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=41, PETRI_TRANSITIONS=40} [2025-03-09 01:25:33,908 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -6 predicate places. [2025-03-09 01:25:33,908 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 40 transitions, 94 flow [2025-03-09 01:25:33,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-09 01:25:33,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:33,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:25:33,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:25:33,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:25:33,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:33,908 INFO L85 PathProgramCache]: Analyzing trace with hash -2088885589, now seen corresponding path program 1 times [2025-03-09 01:25:33,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:33,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110321968] [2025-03-09 01:25:33,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:33,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:33,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:25:33,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:25:33,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:33,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:33,981 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-09 01:25:33,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:33,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110321968] [2025-03-09 01:25:33,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110321968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:25:33,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:25:33,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:25:33,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488957145] [2025-03-09 01:25:33,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:25:33,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:25:33,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:33,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:25:33,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:25:33,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-03-09 01:25:33,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-09 01:25:33,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:33,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-03-09 01:25:33,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:34,213 INFO L124 PetriNetUnfolderBase]: 1081/1711 cut-off events. [2025-03-09 01:25:34,213 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-09 01:25:34,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3349 conditions, 1711 events. 1081/1711 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8245 event pairs, 716 based on Foata normal form. 0/1647 useless extension candidates. Maximal degree in co-relation 1956. Up to 932 conditions per place. [2025-03-09 01:25:34,221 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 66 selfloop transitions, 5 changer transitions 0/77 dead transitions. [2025-03-09 01:25:34,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 77 transitions, 318 flow [2025-03-09 01:25:34,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:25:34,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:25:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2025-03-09 01:25:34,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64 [2025-03-09 01:25:34,224 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 94 flow. Second operand 5 states and 144 transitions. [2025-03-09 01:25:34,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 77 transitions, 318 flow [2025-03-09 01:25:34,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 77 transitions, 313 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:25:34,226 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 114 flow [2025-03-09 01:25:34,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2025-03-09 01:25:34,227 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2025-03-09 01:25:34,228 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 114 flow [2025-03-09 01:25:34,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-09 01:25:34,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:34,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:25:34,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:25:34,229 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:25:34,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:34,229 INFO L85 PathProgramCache]: Analyzing trace with hash 400744806, now seen corresponding path program 1 times [2025-03-09 01:25:34,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:34,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387939355] [2025-03-09 01:25:34,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:34,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:34,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:25:34,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:25:34,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:34,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:34,355 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-09 01:25:34,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:34,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387939355] [2025-03-09 01:25:34,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387939355] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:25:34,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778307090] [2025-03-09 01:25:34,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:34,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:25:34,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:25:34,358 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-09 01:25:34,359 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-09 01:25:34,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:25:34,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:25:34,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:34,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:34,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:25:34,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:25:34,467 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-09 01:25:34,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:25:34,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-09 01:25:34,509 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-09 01:25:34,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778307090] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:25:34,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:25:34,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 01:25:34,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336788126] [2025-03-09 01:25:34,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:25:34,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:25:34,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:34,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:25:34,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:25:34,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-03-09 01:25:34,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 114 flow. Second operand has 11 states, 11 states have (on average 16.454545454545453) internal successors, (181), 11 states have internal predecessors, (181), 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-09 01:25:34,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:34,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-03-09 01:25:34,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:34,937 INFO L124 PetriNetUnfolderBase]: 1290/2037 cut-off events. [2025-03-09 01:25:34,937 INFO L125 PetriNetUnfolderBase]: For 552/638 co-relation queries the response was YES. [2025-03-09 01:25:34,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4427 conditions, 2037 events. 1290/2037 cut-off events. For 552/638 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10181 event pairs, 732 based on Foata normal form. 0/1969 useless extension candidates. Maximal degree in co-relation 2776. Up to 988 conditions per place. [2025-03-09 01:25:34,949 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 65 selfloop transitions, 8 changer transitions 0/79 dead transitions. [2025-03-09 01:25:34,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 79 transitions, 344 flow [2025-03-09 01:25:34,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:25:34,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:25:34,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2025-03-09 01:25:34,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5962962962962963 [2025-03-09 01:25:34,951 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 114 flow. Second operand 6 states and 161 transitions. [2025-03-09 01:25:34,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 79 transitions, 344 flow [2025-03-09 01:25:34,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 79 transitions, 339 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:25:34,953 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 140 flow [2025-03-09 01:25:34,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2025-03-09 01:25:34,954 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2025-03-09 01:25:34,954 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 140 flow [2025-03-09 01:25:34,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.454545454545453) internal successors, (181), 11 states have internal predecessors, (181), 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-09 01:25:34,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:34,955 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:25:34,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:25:35,158 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,SelfDestructingSolverStorable5 [2025-03-09 01:25:35,158 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:25:35,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:35,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1670437546, now seen corresponding path program 1 times [2025-03-09 01:25:35,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:35,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678167550] [2025-03-09 01:25:35,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:35,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:35,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:25:35,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:25:35,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:35,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:35,223 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-09 01:25:35,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:35,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678167550] [2025-03-09 01:25:35,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678167550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:25:35,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:25:35,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:25:35,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956145956] [2025-03-09 01:25:35,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:25:35,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:25:35,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:35,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:25:35,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:25:35,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-03-09 01:25:35,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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-09 01:25:35,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:35,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-03-09 01:25:35,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:35,415 INFO L124 PetriNetUnfolderBase]: 1070/1655 cut-off events. [2025-03-09 01:25:35,415 INFO L125 PetriNetUnfolderBase]: For 1635/1984 co-relation queries the response was YES. [2025-03-09 01:25:35,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4157 conditions, 1655 events. 1070/1655 cut-off events. For 1635/1984 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7523 event pairs, 697 based on Foata normal form. 0/1600 useless extension candidates. Maximal degree in co-relation 3212. Up to 1185 conditions per place. [2025-03-09 01:25:35,432 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 61 selfloop transitions, 5 changer transitions 0/72 dead transitions. [2025-03-09 01:25:35,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 72 transitions, 344 flow [2025-03-09 01:25:35,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:25:35,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:25:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2025-03-09 01:25:35,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6088888888888889 [2025-03-09 01:25:35,433 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 140 flow. Second operand 5 states and 137 transitions. [2025-03-09 01:25:35,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 72 transitions, 344 flow [2025-03-09 01:25:35,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 72 transitions, 329 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-09 01:25:35,435 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 152 flow [2025-03-09 01:25:35,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2025-03-09 01:25:35,435 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2025-03-09 01:25:35,435 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 152 flow [2025-03-09 01:25:35,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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-09 01:25:35,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:35,438 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:25:35,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:25:35,438 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:25:35,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:35,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1432411823, now seen corresponding path program 1 times [2025-03-09 01:25:35,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:35,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945554174] [2025-03-09 01:25:35,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:35,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:35,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:25:35,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:25:35,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:35,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:35,571 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-09 01:25:35,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:35,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945554174] [2025-03-09 01:25:35,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945554174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:25:35,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836830577] [2025-03-09 01:25:35,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:35,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:25:35,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:25:35,573 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-09 01:25:35,575 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-09 01:25:35,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:25:35,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:25:35,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:35,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:35,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:25:35,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:25:35,702 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-09 01:25:35,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:25:35,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-09 01:25:35,755 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-09 01:25:35,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836830577] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:25:35,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:25:35,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 01:25:35,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971243680] [2025-03-09 01:25:35,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:25:35,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:25:35,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:35,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:25:35,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:25:35,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-03-09 01:25:35,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 152 flow. Second operand has 11 states, 11 states have (on average 16.818181818181817) internal successors, (185), 11 states have internal predecessors, (185), 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-09 01:25:35,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:35,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-03-09 01:25:35,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:36,226 INFO L124 PetriNetUnfolderBase]: 1537/2332 cut-off events. [2025-03-09 01:25:36,226 INFO L125 PetriNetUnfolderBase]: For 2261/2841 co-relation queries the response was YES. [2025-03-09 01:25:36,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6059 conditions, 2332 events. 1537/2332 cut-off events. For 2261/2841 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 10609 event pairs, 570 based on Foata normal form. 0/2271 useless extension candidates. Maximal degree in co-relation 4991. Up to 850 conditions per place. [2025-03-09 01:25:36,237 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 77 selfloop transitions, 10 changer transitions 0/93 dead transitions. [2025-03-09 01:25:36,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 93 transitions, 466 flow [2025-03-09 01:25:36,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:25:36,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:25:36,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 184 transitions. [2025-03-09 01:25:36,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5841269841269842 [2025-03-09 01:25:36,238 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 152 flow. Second operand 7 states and 184 transitions. [2025-03-09 01:25:36,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 93 transitions, 466 flow [2025-03-09 01:25:36,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 93 transitions, 461 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:25:36,241 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 191 flow [2025-03-09 01:25:36,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=191, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2025-03-09 01:25:36,241 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 10 predicate places. [2025-03-09 01:25:36,242 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 191 flow [2025-03-09 01:25:36,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.818181818181817) internal successors, (185), 11 states have internal predecessors, (185), 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-09 01:25:36,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:36,243 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:25:36,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:25:36,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:25:36,444 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:25:36,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:36,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1010237242, now seen corresponding path program 1 times [2025-03-09 01:25:36,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:36,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882485429] [2025-03-09 01:25:36,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:36,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:36,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:25:36,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:25:36,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:36,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:36,504 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-09 01:25:36,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:36,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882485429] [2025-03-09 01:25:36,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882485429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:25:36,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:25:36,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:25:36,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627315461] [2025-03-09 01:25:36,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:25:36,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:25:36,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:36,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:25:36,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:25:36,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-03-09 01:25:36,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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-09 01:25:36,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:36,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-03-09 01:25:36,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:36,702 INFO L124 PetriNetUnfolderBase]: 1501/2245 cut-off events. [2025-03-09 01:25:36,702 INFO L125 PetriNetUnfolderBase]: For 3501/4146 co-relation queries the response was YES. [2025-03-09 01:25:36,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6599 conditions, 2245 events. 1501/2245 cut-off events. For 3501/4146 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9824 event pairs, 1035 based on Foata normal form. 0/2166 useless extension candidates. Maximal degree in co-relation 5926. Up to 1895 conditions per place. [2025-03-09 01:25:36,714 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 57 selfloop transitions, 5 changer transitions 0/68 dead transitions. [2025-03-09 01:25:36,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 375 flow [2025-03-09 01:25:36,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:25:36,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:25:36,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2025-03-09 01:25:36,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2025-03-09 01:25:36,716 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 191 flow. Second operand 5 states and 130 transitions. [2025-03-09 01:25:36,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 375 flow [2025-03-09 01:25:36,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 68 transitions, 360 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-09 01:25:36,719 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 203 flow [2025-03-09 01:25:36,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2025-03-09 01:25:36,720 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 12 predicate places. [2025-03-09 01:25:36,720 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 203 flow [2025-03-09 01:25:36,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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-09 01:25:36,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:36,720 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:25:36,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:25:36,721 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:25:36,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:36,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1431280918, now seen corresponding path program 1 times [2025-03-09 01:25:36,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:36,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6364699] [2025-03-09 01:25:36,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:36,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:36,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:25:36,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:25:36,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:36,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:25:36,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:36,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6364699] [2025-03-09 01:25:36,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6364699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:25:36,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528050588] [2025-03-09 01:25:36,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:36,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:25:36,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:25:36,802 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-09 01:25:36,804 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-09 01:25:36,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:25:36,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:25:36,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:36,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:36,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:25:36,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:25:36,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:25:36,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:25:36,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:25:36,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528050588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:25:36,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:25:36,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-09 01:25:36,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374555872] [2025-03-09 01:25:36,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:25:36,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:25:36,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:36,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:25:36,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:25:36,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-03-09 01:25:36,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 203 flow. Second operand has 14 states, 14 states have (on average 16.714285714285715) internal successors, (234), 14 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:25:36,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:36,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-03-09 01:25:36,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:37,424 INFO L124 PetriNetUnfolderBase]: 3111/4745 cut-off events. [2025-03-09 01:25:37,424 INFO L125 PetriNetUnfolderBase]: For 5129/5491 co-relation queries the response was YES. [2025-03-09 01:25:37,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14000 conditions, 4745 events. 3111/4745 cut-off events. For 5129/5491 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 24820 event pairs, 1689 based on Foata normal form. 98/4841 useless extension candidates. Maximal degree in co-relation 13283. Up to 2304 conditions per place. [2025-03-09 01:25:37,460 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 100 selfloop transitions, 13 changer transitions 0/119 dead transitions. [2025-03-09 01:25:37,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 119 transitions, 696 flow [2025-03-09 01:25:37,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:25:37,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:25:37,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2025-03-09 01:25:37,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-09 01:25:37,461 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 203 flow. Second operand 8 states and 210 transitions. [2025-03-09 01:25:37,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 119 transitions, 696 flow [2025-03-09 01:25:37,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 119 transitions, 691 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:25:37,472 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 271 flow [2025-03-09 01:25:37,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=271, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2025-03-09 01:25:37,472 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 20 predicate places. [2025-03-09 01:25:37,473 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 271 flow [2025-03-09 01:25:37,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.714285714285715) internal successors, (234), 14 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:25:37,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:37,473 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:25:37,481 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-09 01:25:37,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:25:37,674 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:25:37,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:37,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2119690357, now seen corresponding path program 1 times [2025-03-09 01:25:37,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:37,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000384303] [2025-03-09 01:25:37,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:37,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:37,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:25:37,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:25:37,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:37,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:37,851 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-09 01:25:37,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:37,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000384303] [2025-03-09 01:25:37,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000384303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:25:37,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:25:37,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:25:37,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838812899] [2025-03-09 01:25:37,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:25:37,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:25:37,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:37,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:25:37,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:25:37,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45 [2025-03-09 01:25:37,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 271 flow. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:25:37,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:37,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45 [2025-03-09 01:25:37,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:38,336 INFO L124 PetriNetUnfolderBase]: 2761/4044 cut-off events. [2025-03-09 01:25:38,336 INFO L125 PetriNetUnfolderBase]: For 11735/13012 co-relation queries the response was YES. [2025-03-09 01:25:38,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13934 conditions, 4044 events. 2761/4044 cut-off events. For 11735/13012 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 19584 event pairs, 769 based on Foata normal form. 0/3889 useless extension candidates. Maximal degree in co-relation 9290. Up to 1602 conditions per place. [2025-03-09 01:25:38,358 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 83 selfloop transitions, 10 changer transitions 0/98 dead transitions. [2025-03-09 01:25:38,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 98 transitions, 731 flow [2025-03-09 01:25:38,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:25:38,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:25:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2025-03-09 01:25:38,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-09 01:25:38,360 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 271 flow. Second operand 6 states and 135 transitions. [2025-03-09 01:25:38,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 98 transitions, 731 flow [2025-03-09 01:25:38,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 98 transitions, 707 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-09 01:25:38,368 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 273 flow [2025-03-09 01:25:38,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=273, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2025-03-09 01:25:38,368 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 20 predicate places. [2025-03-09 01:25:38,368 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 273 flow [2025-03-09 01:25:38,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:25:38,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:38,369 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:25:38,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:25:38,369 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:25:38,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:38,369 INFO L85 PathProgramCache]: Analyzing trace with hash -321827803, now seen corresponding path program 2 times [2025-03-09 01:25:38,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:38,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630937135] [2025-03-09 01:25:38,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:25:38,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:38,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 01:25:38,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:25:38,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:25:38,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:38,546 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:25:38,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:38,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630937135] [2025-03-09 01:25:38,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630937135] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:25:38,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569166305] [2025-03-09 01:25:38,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:25:38,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:25:38,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:25:38,549 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-09 01:25:38,550 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-09 01:25:38,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 01:25:38,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:25:38,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:25:38,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:38,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:25:38,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:25:38,628 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 8 treesize of output 1 [2025-03-09 01:25:38,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:25:38,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:25:38,847 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:25:38,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569166305] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:25:38,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:25:38,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-09 01:25:38,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668949936] [2025-03-09 01:25:38,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:25:38,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:25:38,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:38,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:25:38,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:25:39,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2025-03-09 01:25:39,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 273 flow. Second operand has 20 states, 20 states have (on average 14.75) internal successors, (295), 20 states have internal predecessors, (295), 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-09 01:25:39,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:39,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2025-03-09 01:25:39,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:40,073 INFO L124 PetriNetUnfolderBase]: 4011/5725 cut-off events. [2025-03-09 01:25:40,073 INFO L125 PetriNetUnfolderBase]: For 9661/10245 co-relation queries the response was YES. [2025-03-09 01:25:40,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19977 conditions, 5725 events. 4011/5725 cut-off events. For 9661/10245 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 28133 event pairs, 851 based on Foata normal form. 0/5721 useless extension candidates. Maximal degree in co-relation 10634. Up to 1061 conditions per place. [2025-03-09 01:25:40,100 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 184 selfloop transitions, 25 changer transitions 0/213 dead transitions. [2025-03-09 01:25:40,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 213 transitions, 1366 flow [2025-03-09 01:25:40,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:25:40,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 01:25:40,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 356 transitions. [2025-03-09 01:25:40,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5650793650793651 [2025-03-09 01:25:40,102 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 273 flow. Second operand 14 states and 356 transitions. [2025-03-09 01:25:40,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 213 transitions, 1366 flow [2025-03-09 01:25:40,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 213 transitions, 1294 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 01:25:40,112 INFO L231 Difference]: Finished difference. Result has 76 places, 61 transitions, 367 flow [2025-03-09 01:25:40,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=367, PETRI_PLACES=76, PETRI_TRANSITIONS=61} [2025-03-09 01:25:40,112 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2025-03-09 01:25:40,112 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 61 transitions, 367 flow [2025-03-09 01:25:40,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 14.75) internal successors, (295), 20 states have internal predecessors, (295), 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-09 01:25:40,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:40,113 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:25:40,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:25:40,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-09 01:25:40,317 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:25:40,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:40,317 INFO L85 PathProgramCache]: Analyzing trace with hash 429720758, now seen corresponding path program 1 times [2025-03-09 01:25:40,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:40,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818545584] [2025-03-09 01:25:40,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:40,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:40,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:25:40,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:25:40,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:40,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:25:40,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:40,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818545584] [2025-03-09 01:25:40,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818545584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:25:40,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729913422] [2025-03-09 01:25:40,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:40,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:25:40,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:25:40,395 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-09 01:25:40,396 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-09 01:25:40,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:25:40,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:25:40,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:40,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:40,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:25:40,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:25:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:25:40,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:25:40,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:25:40,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729913422] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:25:40,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:25:40,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-09 01:25:40,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498286723] [2025-03-09 01:25:40,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:25:40,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 01:25:40,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:40,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 01:25:40,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:25:40,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-03-09 01:25:40,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 61 transitions, 367 flow. Second operand has 15 states, 15 states have (on average 17.333333333333332) internal successors, (260), 15 states have internal predecessors, (260), 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-09 01:25:40,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:40,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-03-09 01:25:40,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:41,064 INFO L124 PetriNetUnfolderBase]: 3520/5131 cut-off events. [2025-03-09 01:25:41,064 INFO L125 PetriNetUnfolderBase]: For 18429/19286 co-relation queries the response was YES. [2025-03-09 01:25:41,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19447 conditions, 5131 events. 3520/5131 cut-off events. For 18429/19286 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 24933 event pairs, 1781 based on Foata normal form. 119/5176 useless extension candidates. Maximal degree in co-relation 12599. Up to 2914 conditions per place. [2025-03-09 01:25:41,089 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 97 selfloop transitions, 13 changer transitions 0/116 dead transitions. [2025-03-09 01:25:41,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 116 transitions, 873 flow [2025-03-09 01:25:41,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:25:41,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:25:41,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions. [2025-03-09 01:25:41,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-03-09 01:25:41,091 INFO L175 Difference]: Start difference. First operand has 76 places, 61 transitions, 367 flow. Second operand 8 states and 204 transitions. [2025-03-09 01:25:41,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 116 transitions, 873 flow [2025-03-09 01:25:41,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 116 transitions, 751 flow, removed 12 selfloop flow, removed 10 redundant places. [2025-03-09 01:25:41,101 INFO L231 Difference]: Finished difference. Result has 76 places, 64 transitions, 365 flow [2025-03-09 01:25:41,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=365, PETRI_PLACES=76, PETRI_TRANSITIONS=64} [2025-03-09 01:25:41,101 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2025-03-09 01:25:41,101 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 64 transitions, 365 flow [2025-03-09 01:25:41,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 17.333333333333332) internal successors, (260), 15 states have internal predecessors, (260), 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-09 01:25:41,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:41,102 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:25:41,107 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-09 01:25:41,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:25:41,306 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:25:41,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:41,306 INFO L85 PathProgramCache]: Analyzing trace with hash 576772209, now seen corresponding path program 2 times [2025-03-09 01:25:41,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:41,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890222906] [2025-03-09 01:25:41,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:25:41,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:41,311 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-09 01:25:41,315 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:25:41,315 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:25:41,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:41,440 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:25:41,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:41,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890222906] [2025-03-09 01:25:41,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890222906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:25:41,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547374359] [2025-03-09 01:25:41,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:25:41,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:25:41,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:25:41,447 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-09 01:25:41,449 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-09 01:25:41,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-09 01:25:41,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:25:41,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:25:41,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:41,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 01:25:41,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:25:41,621 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:25:41,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:25:41,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-09 01:25:41,748 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:25:41,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547374359] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:25:41,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:25:41,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-09 01:25:41,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649438680] [2025-03-09 01:25:41,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:25:41,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:25:41,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:41,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:25:41,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:25:42,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45 [2025-03-09 01:25:42,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 64 transitions, 365 flow. Second operand has 20 states, 20 states have (on average 16.35) internal successors, (327), 20 states have internal predecessors, (327), 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-09 01:25:42,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:42,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45 [2025-03-09 01:25:42,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:43,131 INFO L124 PetriNetUnfolderBase]: 4466/6316 cut-off events. [2025-03-09 01:25:43,131 INFO L125 PetriNetUnfolderBase]: For 13765/14565 co-relation queries the response was YES. [2025-03-09 01:25:43,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22163 conditions, 6316 events. 4466/6316 cut-off events. For 13765/14565 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 29380 event pairs, 629 based on Foata normal form. 232/6448 useless extension candidates. Maximal degree in co-relation 14570. Up to 1172 conditions per place. [2025-03-09 01:25:43,154 INFO L140 encePairwiseOnDemand]: 37/45 looper letters, 175 selfloop transitions, 21 changer transitions 0/201 dead transitions. [2025-03-09 01:25:43,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 201 transitions, 1350 flow [2025-03-09 01:25:43,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:25:43,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 01:25:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 351 transitions. [2025-03-09 01:25:43,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2025-03-09 01:25:43,156 INFO L175 Difference]: Start difference. First operand has 76 places, 64 transitions, 365 flow. Second operand 14 states and 351 transitions. [2025-03-09 01:25:43,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 201 transitions, 1350 flow [2025-03-09 01:25:43,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 201 transitions, 1334 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-09 01:25:43,167 INFO L231 Difference]: Finished difference. Result has 86 places, 67 transitions, 425 flow [2025-03-09 01:25:43,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=425, PETRI_PLACES=86, PETRI_TRANSITIONS=67} [2025-03-09 01:25:43,168 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 39 predicate places. [2025-03-09 01:25:43,168 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 67 transitions, 425 flow [2025-03-09 01:25:43,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 16.35) internal successors, (327), 20 states have internal predecessors, (327), 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-09 01:25:43,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:43,169 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:25:43,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:25:43,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:25:43,371 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:25:43,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:43,372 INFO L85 PathProgramCache]: Analyzing trace with hash 225723634, now seen corresponding path program 1 times [2025-03-09 01:25:43,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:43,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728670568] [2025-03-09 01:25:43,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:43,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:43,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:25:43,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:25:43,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:43,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:25:43,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:43,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728670568] [2025-03-09 01:25:43,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728670568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:25:43,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:25:43,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:25:43,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999205990] [2025-03-09 01:25:43,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:25:43,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:25:43,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:43,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:25:43,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:25:43,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2025-03-09 01:25:43,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 67 transitions, 425 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-09 01:25:43,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:43,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2025-03-09 01:25:43,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:43,746 INFO L124 PetriNetUnfolderBase]: 4270/6343 cut-off events. [2025-03-09 01:25:43,746 INFO L125 PetriNetUnfolderBase]: For 21120/22020 co-relation queries the response was YES. [2025-03-09 01:25:43,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23716 conditions, 6343 events. 4270/6343 cut-off events. For 21120/22020 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 32939 event pairs, 913 based on Foata normal form. 47/6272 useless extension candidates. Maximal degree in co-relation 15182. Up to 4832 conditions per place. [2025-03-09 01:25:43,770 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 73 selfloop transitions, 5 changer transitions 8/94 dead transitions. [2025-03-09 01:25:43,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 94 transitions, 753 flow [2025-03-09 01:25:43,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:25:43,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:25:43,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-03-09 01:25:43,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2025-03-09 01:25:43,772 INFO L175 Difference]: Start difference. First operand has 86 places, 67 transitions, 425 flow. Second operand 3 states and 95 transitions. [2025-03-09 01:25:43,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 94 transitions, 753 flow [2025-03-09 01:25:43,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 94 transitions, 676 flow, removed 12 selfloop flow, removed 10 redundant places. [2025-03-09 01:25:43,783 INFO L231 Difference]: Finished difference. Result has 79 places, 64 transitions, 353 flow [2025-03-09 01:25:43,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=353, PETRI_PLACES=79, PETRI_TRANSITIONS=64} [2025-03-09 01:25:43,784 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 32 predicate places. [2025-03-09 01:25:43,784 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 64 transitions, 353 flow [2025-03-09 01:25:43,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-09 01:25:43,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:43,784 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] [2025-03-09 01:25:43,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:25:43,785 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:25:43,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:43,785 INFO L85 PathProgramCache]: Analyzing trace with hash 924591147, now seen corresponding path program 1 times [2025-03-09 01:25:43,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:43,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161447603] [2025-03-09 01:25:43,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:43,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:43,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:25:43,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:25:43,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:43,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:25:43,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:43,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161447603] [2025-03-09 01:25:43,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161447603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:25:43,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788786271] [2025-03-09 01:25:43,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:43,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:25:43,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:25:43,858 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-09 01:25:43,859 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-09 01:25:43,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:25:43,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:25:43,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:43,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:43,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:25:43,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:25:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:25:43,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:25:44,020 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:25:44,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788786271] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:25:44,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:25:44,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2025-03-09 01:25:44,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574271725] [2025-03-09 01:25:44,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:25:44,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:25:44,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:44,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:25:44,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:25:44,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45 [2025-03-09 01:25:44,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 64 transitions, 353 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 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-09 01:25:44,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:44,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45 [2025-03-09 01:25:44,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:44,577 INFO L124 PetriNetUnfolderBase]: 6270/8870 cut-off events. [2025-03-09 01:25:44,578 INFO L125 PetriNetUnfolderBase]: For 22498/23470 co-relation queries the response was YES. [2025-03-09 01:25:44,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32517 conditions, 8870 events. 6270/8870 cut-off events. For 22498/23470 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 44250 event pairs, 1136 based on Foata normal form. 89/8334 useless extension candidates. Maximal degree in co-relation 21374. Up to 2457 conditions per place. [2025-03-09 01:25:44,620 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 168 selfloop transitions, 21 changer transitions 0/193 dead transitions. [2025-03-09 01:25:44,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 193 transitions, 1522 flow [2025-03-09 01:25:44,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:25:44,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:25:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 220 transitions. [2025-03-09 01:25:44,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5432098765432098 [2025-03-09 01:25:44,622 INFO L175 Difference]: Start difference. First operand has 79 places, 64 transitions, 353 flow. Second operand 9 states and 220 transitions. [2025-03-09 01:25:44,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 193 transitions, 1522 flow [2025-03-09 01:25:44,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 193 transitions, 1286 flow, removed 48 selfloop flow, removed 8 redundant places. [2025-03-09 01:25:44,663 INFO L231 Difference]: Finished difference. Result has 75 places, 76 transitions, 403 flow [2025-03-09 01:25:44,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=403, PETRI_PLACES=75, PETRI_TRANSITIONS=76} [2025-03-09 01:25:44,664 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 28 predicate places. [2025-03-09 01:25:44,664 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 76 transitions, 403 flow [2025-03-09 01:25:44,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 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-09 01:25:44,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:44,664 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] [2025-03-09 01:25:44,670 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-09 01:25:44,864 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,SelfDestructingSolverStorable15 [2025-03-09 01:25:44,865 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:25:44,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:44,865 INFO L85 PathProgramCache]: Analyzing trace with hash 970114765, now seen corresponding path program 2 times [2025-03-09 01:25:44,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:44,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108652447] [2025-03-09 01:25:44,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:25:44,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:44,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:25:44,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:25:44,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:25:44,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:25:44,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:44,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108652447] [2025-03-09 01:25:44,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108652447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:25:44,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972811850] [2025-03-09 01:25:44,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:25:44,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:25:44,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:25:44,916 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-09 01:25:44,918 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-09 01:25:44,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:25:44,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:25:44,973 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:25:44,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:44,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:25:44,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:25:45,019 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:25:45,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:25:45,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:25:45,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972811850] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:25:45,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:25:45,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 12 [2025-03-09 01:25:45,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914146485] [2025-03-09 01:25:45,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:25:45,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:25:45,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:45,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:25:45,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:25:45,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45 [2025-03-09 01:25:45,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 76 transitions, 403 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 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-09 01:25:45,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:45,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45 [2025-03-09 01:25:45,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:45,736 INFO L124 PetriNetUnfolderBase]: 7487/10605 cut-off events. [2025-03-09 01:25:45,736 INFO L125 PetriNetUnfolderBase]: For 18366/18887 co-relation queries the response was YES. [2025-03-09 01:25:45,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35863 conditions, 10605 events. 7487/10605 cut-off events. For 18366/18887 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 53541 event pairs, 932 based on Foata normal form. 133/10450 useless extension candidates. Maximal degree in co-relation 26035. Up to 2793 conditions per place. [2025-03-09 01:25:45,781 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 173 selfloop transitions, 42 changer transitions 0/219 dead transitions. [2025-03-09 01:25:45,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 219 transitions, 1592 flow [2025-03-09 01:25:45,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:25:45,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:25:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 211 transitions. [2025-03-09 01:25:45,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5209876543209877 [2025-03-09 01:25:45,784 INFO L175 Difference]: Start difference. First operand has 75 places, 76 transitions, 403 flow. Second operand 9 states and 211 transitions. [2025-03-09 01:25:45,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 219 transitions, 1592 flow [2025-03-09 01:25:45,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 219 transitions, 1589 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:25:45,815 INFO L231 Difference]: Finished difference. Result has 87 places, 104 transitions, 765 flow [2025-03-09 01:25:45,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=765, PETRI_PLACES=87, PETRI_TRANSITIONS=104} [2025-03-09 01:25:45,816 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 40 predicate places. [2025-03-09 01:25:45,816 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 104 transitions, 765 flow [2025-03-09 01:25:45,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 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-09 01:25:45,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:45,816 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] [2025-03-09 01:25:45,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 01:25:46,017 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,SelfDestructingSolverStorable16 [2025-03-09 01:25:46,017 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:25:46,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:46,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1602546233, now seen corresponding path program 3 times [2025-03-09 01:25:46,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:46,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777526306] [2025-03-09 01:25:46,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:25:46,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:46,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-03-09 01:25:46,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 23 statements. [2025-03-09 01:25:46,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:25:46,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:25:46,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:46,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777526306] [2025-03-09 01:25:46,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777526306] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:25:46,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193188272] [2025-03-09 01:25:46,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:25:46,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:25:46,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:25:46,069 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-09 01:25:46,070 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-09 01:25:46,110 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-03-09 01:25:46,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 23 statements. [2025-03-09 01:25:46,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:25:46,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:46,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:25:46,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:25:46,171 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:25:46,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:25:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:25:46,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193188272] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:25:46,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:25:46,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-09 01:25:46,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501219073] [2025-03-09 01:25:46,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:25:46,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:25:46,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:46,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:25:46,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:25:46,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2025-03-09 01:25:46,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 104 transitions, 765 flow. Second operand has 11 states, 11 states have (on average 16.0) internal successors, (176), 11 states have internal predecessors, (176), 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-09 01:25:46,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:46,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2025-03-09 01:25:46,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:48,370 INFO L124 PetriNetUnfolderBase]: 18842/26514 cut-off events. [2025-03-09 01:25:48,370 INFO L125 PetriNetUnfolderBase]: For 87903/87903 co-relation queries the response was YES. [2025-03-09 01:25:48,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106754 conditions, 26514 events. 18842/26514 cut-off events. For 87903/87903 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 148077 event pairs, 964 based on Foata normal form. 22/25736 useless extension candidates. Maximal degree in co-relation 90990. Up to 4445 conditions per place. [2025-03-09 01:25:48,515 INFO L140 encePairwiseOnDemand]: 33/45 looper letters, 488 selfloop transitions, 389 changer transitions 0/878 dead transitions. [2025-03-09 01:25:48,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 878 transitions, 8439 flow [2025-03-09 01:25:48,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-09 01:25:48,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-09 01:25:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 761 transitions. [2025-03-09 01:25:48,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5455197132616487 [2025-03-09 01:25:48,517 INFO L175 Difference]: Start difference. First operand has 87 places, 104 transitions, 765 flow. Second operand 31 states and 761 transitions. [2025-03-09 01:25:48,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 878 transitions, 8439 flow [2025-03-09 01:25:49,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 878 transitions, 8364 flow, removed 36 selfloop flow, removed 2 redundant places. [2025-03-09 01:25:49,103 INFO L231 Difference]: Finished difference. Result has 141 places, 506 transitions, 6257 flow [2025-03-09 01:25:49,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=6257, PETRI_PLACES=141, PETRI_TRANSITIONS=506} [2025-03-09 01:25:49,103 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 94 predicate places. [2025-03-09 01:25:49,103 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 506 transitions, 6257 flow [2025-03-09 01:25:49,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.0) internal successors, (176), 11 states have internal predecessors, (176), 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-09 01:25:49,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:49,104 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] [2025-03-09 01:25:49,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 01:25:49,304 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,SelfDestructingSolverStorable17 [2025-03-09 01:25:49,304 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:25:49,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:49,305 INFO L85 PathProgramCache]: Analyzing trace with hash 595186899, now seen corresponding path program 4 times [2025-03-09 01:25:49,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:49,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73064787] [2025-03-09 01:25:49,305 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:25:49,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:49,309 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:25:49,311 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-03-09 01:25:49,311 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 01:25:49,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:49,340 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:25:49,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:49,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73064787] [2025-03-09 01:25:49,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73064787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:25:49,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:25:49,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:25:49,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159614737] [2025-03-09 01:25:49,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:25:49,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:25:49,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:49,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:25:49,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:25:49,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2025-03-09 01:25:49,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 506 transitions, 6257 flow. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:25:49,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:49,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2025-03-09 01:25:49,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:53,006 INFO L124 PetriNetUnfolderBase]: 21614/30382 cut-off events. [2025-03-09 01:25:53,006 INFO L125 PetriNetUnfolderBase]: For 208290/208290 co-relation queries the response was YES. [2025-03-09 01:25:53,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151176 conditions, 30382 events. 21614/30382 cut-off events. For 208290/208290 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 173386 event pairs, 6397 based on Foata normal form. 4/30386 useless extension candidates. Maximal degree in co-relation 145965. Up to 13952 conditions per place. [2025-03-09 01:25:53,281 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 551 selfloop transitions, 222 changer transitions 7/781 dead transitions. [2025-03-09 01:25:53,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 781 transitions, 10556 flow [2025-03-09 01:25:53,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:25:53,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:25:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2025-03-09 01:25:53,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-09 01:25:53,282 INFO L175 Difference]: Start difference. First operand has 141 places, 506 transitions, 6257 flow. Second operand 7 states and 180 transitions. [2025-03-09 01:25:53,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 781 transitions, 10556 flow [2025-03-09 01:25:55,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 781 transitions, 10380 flow, removed 88 selfloop flow, removed 0 redundant places. [2025-03-09 01:25:55,133 INFO L231 Difference]: Finished difference. Result has 152 places, 568 transitions, 7762 flow [2025-03-09 01:25:55,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=6135, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7762, PETRI_PLACES=152, PETRI_TRANSITIONS=568} [2025-03-09 01:25:55,133 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 105 predicate places. [2025-03-09 01:25:55,133 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 568 transitions, 7762 flow [2025-03-09 01:25:55,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:25:55,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:55,134 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] [2025-03-09 01:25:55,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 01:25:55,134 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:25:55,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:55,134 INFO L85 PathProgramCache]: Analyzing trace with hash 164090911, now seen corresponding path program 5 times [2025-03-09 01:25:55,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:55,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501910275] [2025-03-09 01:25:55,134 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:25:55,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:55,139 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-03-09 01:25:55,143 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:25:55,143 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:25:55,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:25:55,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:55,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501910275] [2025-03-09 01:25:55,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501910275] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:25:55,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19380805] [2025-03-09 01:25:55,186 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:25:55,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:25:55,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:25:55,188 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-09 01:25:55,189 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-09 01:25:55,229 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 3 equivalence classes. [2025-03-09 01:25:55,245 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:25:55,245 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:25:55,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:55,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:25:55,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:25:55,310 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:25:55,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:25:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:25:55,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19380805] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:25:55,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:25:55,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-03-09 01:25:55,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710550749] [2025-03-09 01:25:55,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:25:55,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:25:55,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:55,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:25:55,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:25:55,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45 [2025-03-09 01:25:55,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 568 transitions, 7762 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 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-09 01:25:55,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:55,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45 [2025-03-09 01:25:55,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:58,958 INFO L124 PetriNetUnfolderBase]: 19244/27417 cut-off events. [2025-03-09 01:25:58,958 INFO L125 PetriNetUnfolderBase]: For 208658/209877 co-relation queries the response was YES. [2025-03-09 01:25:59,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138560 conditions, 27417 events. 19244/27417 cut-off events. For 208658/209877 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 162153 event pairs, 2800 based on Foata normal form. 219/27372 useless extension candidates. Maximal degree in co-relation 133077. Up to 12724 conditions per place. [2025-03-09 01:25:59,581 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 433 selfloop transitions, 305 changer transitions 0/749 dead transitions. [2025-03-09 01:25:59,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 749 transitions, 11082 flow [2025-03-09 01:25:59,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:25:59,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:25:59,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2025-03-09 01:25:59,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5527777777777778 [2025-03-09 01:25:59,583 INFO L175 Difference]: Start difference. First operand has 152 places, 568 transitions, 7762 flow. Second operand 8 states and 199 transitions. [2025-03-09 01:25:59,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 749 transitions, 11082 flow [2025-03-09 01:26:01,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 749 transitions, 10814 flow, removed 34 selfloop flow, removed 2 redundant places. [2025-03-09 01:26:01,014 INFO L231 Difference]: Finished difference. Result has 159 places, 620 transitions, 9428 flow [2025-03-09 01:26:01,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=7540, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=253, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9428, PETRI_PLACES=159, PETRI_TRANSITIONS=620} [2025-03-09 01:26:01,015 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 112 predicate places. [2025-03-09 01:26:01,015 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 620 transitions, 9428 flow [2025-03-09 01:26:01,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 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-09 01:26:01,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:01,015 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] [2025-03-09 01:26:01,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 01:26:01,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:01,215 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:26:01,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:01,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2142519897, now seen corresponding path program 6 times [2025-03-09 01:26:01,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:01,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61517522] [2025-03-09 01:26:01,216 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:26:01,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:01,220 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-03-09 01:26:01,224 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:26:01,224 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-09 01:26:01,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:01,267 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:26:01,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:01,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61517522] [2025-03-09 01:26:01,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61517522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:01,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565197473] [2025-03-09 01:26:01,267 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:26:01,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:01,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:01,270 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-09 01:26:01,273 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-09 01:26:01,318 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-03-09 01:26:01,334 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:26:01,335 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-09 01:26:01,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:01,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:26:01,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:26:01,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:01,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:26:01,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565197473] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:01,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:26:01,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2025-03-09 01:26:01,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325003691] [2025-03-09 01:26:01,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:01,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:26:01,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:01,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:26:01,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:26:01,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45 [2025-03-09 01:26:01,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 620 transitions, 9428 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 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-09 01:26:01,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:01,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45 [2025-03-09 01:26:01,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:05,551 INFO L124 PetriNetUnfolderBase]: 20512/29268 cut-off events. [2025-03-09 01:26:05,551 INFO L125 PetriNetUnfolderBase]: For 249864/250936 co-relation queries the response was YES. [2025-03-09 01:26:05,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152530 conditions, 29268 events. 20512/29268 cut-off events. For 249864/250936 co-relation queries the response was YES. Maximal size of possible extension queue 960. Compared 175617 event pairs, 3151 based on Foata normal form. 261/29249 useless extension candidates. Maximal degree in co-relation 148589. Up to 12051 conditions per place. [2025-03-09 01:26:05,846 INFO L140 encePairwiseOnDemand]: 35/45 looper letters, 404 selfloop transitions, 439 changer transitions 1/855 dead transitions. [2025-03-09 01:26:05,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 855 transitions, 13313 flow [2025-03-09 01:26:05,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:26:05,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:26:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 231 transitions. [2025-03-09 01:26:05,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5703703703703704 [2025-03-09 01:26:05,847 INFO L175 Difference]: Start difference. First operand has 159 places, 620 transitions, 9428 flow. Second operand 9 states and 231 transitions. [2025-03-09 01:26:05,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 855 transitions, 13313 flow [2025-03-09 01:26:08,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 855 transitions, 12882 flow, removed 70 selfloop flow, removed 4 redundant places. [2025-03-09 01:26:08,274 INFO L231 Difference]: Finished difference. Result has 166 places, 676 transitions, 11268 flow [2025-03-09 01:26:08,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=8999, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=379, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11268, PETRI_PLACES=166, PETRI_TRANSITIONS=676} [2025-03-09 01:26:08,274 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 119 predicate places. [2025-03-09 01:26:08,274 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 676 transitions, 11268 flow [2025-03-09 01:26:08,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 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-09 01:26:08,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:08,275 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] [2025-03-09 01:26:08,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 01:26:08,475 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,SelfDestructingSolverStorable20 [2025-03-09 01:26:08,475 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:26:08,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:08,476 INFO L85 PathProgramCache]: Analyzing trace with hash 84725671, now seen corresponding path program 7 times [2025-03-09 01:26:08,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:08,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146258668] [2025-03-09 01:26:08,476 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:26:08,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:08,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:26:08,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:26:08,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:08,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:08,567 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:26:08,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:08,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146258668] [2025-03-09 01:26:08,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146258668] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:08,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986894951] [2025-03-09 01:26:08,568 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:26:08,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:26:08,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:26:08,570 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-09 01:26:08,572 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-09 01:26:08,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:26:08,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:26:08,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:26:08,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:08,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:26:08,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:26:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:26:08,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:26:08,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:26:08,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986894951] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:26:08,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:26:08,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 15 [2025-03-09 01:26:08,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686889639] [2025-03-09 01:26:08,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:08,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:26:08,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:08,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:26:08,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:26:08,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45 [2025-03-09 01:26:08,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 676 transitions, 11268 flow. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 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-09 01:26:08,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:08,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45 [2025-03-09 01:26:08,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:12,581 INFO L124 PetriNetUnfolderBase]: 20496/29193 cut-off events. [2025-03-09 01:26:12,581 INFO L125 PetriNetUnfolderBase]: For 286881/287909 co-relation queries the response was YES. [2025-03-09 01:26:12,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153907 conditions, 29193 events. 20496/29193 cut-off events. For 286881/287909 co-relation queries the response was YES. Maximal size of possible extension queue 958. Compared 174123 event pairs, 2954 based on Foata normal form. 235/29131 useless extension candidates. Maximal degree in co-relation 153184. Up to 7736 conditions per place. [2025-03-09 01:26:12,908 INFO L140 encePairwiseOnDemand]: 34/45 looper letters, 306 selfloop transitions, 471 changer transitions 0/788 dead transitions. [2025-03-09 01:26:12,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 788 transitions, 13593 flow [2025-03-09 01:26:12,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:26:12,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:26:12,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 226 transitions. [2025-03-09 01:26:12,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5580246913580247 [2025-03-09 01:26:12,909 INFO L175 Difference]: Start difference. First operand has 166 places, 676 transitions, 11268 flow. Second operand 9 states and 226 transitions. [2025-03-09 01:26:12,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 788 transitions, 13593 flow [2025-03-09 01:26:15,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 788 transitions, 13310 flow, removed 92 selfloop flow, removed 6 redundant places. [2025-03-09 01:26:15,564 INFO L231 Difference]: Finished difference. Result has 167 places, 679 transitions, 11957 flow [2025-03-09 01:26:15,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=10980, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=467, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11957, PETRI_PLACES=167, PETRI_TRANSITIONS=679} [2025-03-09 01:26:15,565 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 120 predicate places. [2025-03-09 01:26:15,565 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 679 transitions, 11957 flow [2025-03-09 01:26:15,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 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-09 01:26:15,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:15,565 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] [2025-03-09 01:26:15,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-09 01:26:15,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 01:26:15,766 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:26:15,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:15,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1505842765, now seen corresponding path program 8 times [2025-03-09 01:26:15,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:15,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224221766] [2025-03-09 01:26:15,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:26:15,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:15,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:26:15,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:26:15,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:26:15,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:26:15,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:15,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224221766] [2025-03-09 01:26:15,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224221766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:15,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:15,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:26:15,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917707776] [2025-03-09 01:26:15,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:15,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:26:15,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:15,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:26:15,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:26:15,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2025-03-09 01:26:15,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 679 transitions, 11957 flow. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:15,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:15,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2025-03-09 01:26:15,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:26:21,466 INFO L124 PetriNetUnfolderBase]: 30277/42527 cut-off events. [2025-03-09 01:26:21,466 INFO L125 PetriNetUnfolderBase]: For 446683/446683 co-relation queries the response was YES. [2025-03-09 01:26:22,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234927 conditions, 42527 events. 30277/42527 cut-off events. For 446683/446683 co-relation queries the response was YES. Maximal size of possible extension queue 1018. Compared 249642 event pairs, 9980 based on Foata normal form. 4/42531 useless extension candidates. Maximal degree in co-relation 230421. Up to 23903 conditions per place. [2025-03-09 01:26:22,282 INFO L140 encePairwiseOnDemand]: 36/45 looper letters, 841 selfloop transitions, 199 changer transitions 9/1050 dead transitions. [2025-03-09 01:26:22,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 1050 transitions, 18892 flow [2025-03-09 01:26:22,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:26:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:26:22,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2025-03-09 01:26:22,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5650793650793651 [2025-03-09 01:26:22,283 INFO L175 Difference]: Start difference. First operand has 167 places, 679 transitions, 11957 flow. Second operand 7 states and 178 transitions. [2025-03-09 01:26:22,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 1050 transitions, 18892 flow [2025-03-09 01:26:27,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 1050 transitions, 18613 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-09 01:26:27,548 INFO L231 Difference]: Finished difference. Result has 175 places, 793 transitions, 14955 flow [2025-03-09 01:26:27,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=11730, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=14955, PETRI_PLACES=175, PETRI_TRANSITIONS=793} [2025-03-09 01:26:27,549 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 128 predicate places. [2025-03-09 01:26:27,549 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 793 transitions, 14955 flow [2025-03-09 01:26:27,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:27,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:26:27,549 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] [2025-03-09 01:26:27,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 01:26:27,549 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-03-09 01:26:27,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:26:27,550 INFO L85 PathProgramCache]: Analyzing trace with hash -967053159, now seen corresponding path program 9 times [2025-03-09 01:26:27,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:26:27,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534609508] [2025-03-09 01:26:27,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:26:27,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:26:27,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-03-09 01:26:27,557 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-03-09 01:26:27,557 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:26:27,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:26:27,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:26:27,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:26:27,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534609508] [2025-03-09 01:26:27,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534609508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:26:27,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:26:27,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:26:27,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359105176] [2025-03-09 01:26:27,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:26:27,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:26:27,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:26:27,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:26:27,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:26:27,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45 [2025-03-09 01:26:27,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 793 transitions, 14955 flow. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:26:27,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:26:27,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45 [2025-03-09 01:26:27,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand