./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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/chl-chromosome-trans.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 f36f5593156fc25b34b4c706b0d898a2d66ee8bab5f6d91cd69ff9cf3c129193 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:06:38,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:06:38,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:06:38,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:06:38,851 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:06:38,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:06:38,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:06:38,871 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:06:38,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:06:38,871 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:06:38,871 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:06:38,872 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:06:38,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:06:38,872 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:06:38,872 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:06:38,872 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:06:38,872 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:06:38,872 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:06:38,872 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:06:38,872 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:06:38,872 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:06:38,872 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:06:38,872 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:06:38,872 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:06:38,874 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:06:38,874 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:06:38,874 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:06:38,874 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:06:38,875 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:06:38,875 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:06:38,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:06:38,875 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:06:38,875 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:06:38,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:06:38,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:06:38,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:06:38,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:06:38,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:06:38,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:06:38,876 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:06:38,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:06:38,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:06:38,876 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 -> f36f5593156fc25b34b4c706b0d898a2d66ee8bab5f6d91cd69ff9cf3c129193 [2025-03-04 10:06:39,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:06:39,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:06:39,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:06:39,087 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:06:39,088 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:06:39,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c [2025-03-04 10:06:40,217 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec54c349a/7f6e9cfb582643089bffcac45d6d5555/FLAG77034a11e [2025-03-04 10:06:40,490 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:06:40,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c [2025-03-04 10:06:40,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec54c349a/7f6e9cfb582643089bffcac45d6d5555/FLAG77034a11e [2025-03-04 10:06:40,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec54c349a/7f6e9cfb582643089bffcac45d6d5555 [2025-03-04 10:06:40,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:06:40,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:06:40,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:06:40,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:06:40,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:06:40,522 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:06:40" (1/1) ... [2025-03-04 10:06:40,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:40, skipping insertion in model container [2025-03-04 10:06:40,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:06:40" (1/1) ... [2025-03-04 10:06:40,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:06:40,662 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-04 10:06:40,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:06:40,676 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:06:40,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:06:40,715 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:06:40,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:40 WrapperNode [2025-03-04 10:06:40,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:06:40,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:06:40,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:06:40,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:06:40,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:40" (1/1) ... [2025-03-04 10:06:40,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:40" (1/1) ... [2025-03-04 10:06:40,754 INFO L138 Inliner]: procedures = 25, calls = 32, calls flagged for inlining = 17, calls inlined = 25, statements flattened = 251 [2025-03-04 10:06:40,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:06:40,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:06:40,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:06:40,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:06:40,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:40" (1/1) ... [2025-03-04 10:06:40,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:40" (1/1) ... [2025-03-04 10:06:40,763 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:40" (1/1) ... [2025-03-04 10:06:40,783 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-04 10:06:40,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:40" (1/1) ... [2025-03-04 10:06:40,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:40" (1/1) ... [2025-03-04 10:06:40,790 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:40" (1/1) ... [2025-03-04 10:06:40,791 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:40" (1/1) ... [2025-03-04 10:06:40,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:40" (1/1) ... [2025-03-04 10:06:40,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:40" (1/1) ... [2025-03-04 10:06:40,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:06:40,794 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:06:40,794 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:06:40,794 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:06:40,799 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:40" (1/1) ... [2025-03-04 10:06:40,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:06:40,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:40,830 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-04 10:06:40,832 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-04 10:06:40,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:06:40,846 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:06:40,846 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:06:40,846 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:06:40,846 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:06:40,846 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:06:40,846 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:06:40,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:06:40,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:06:40,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:06:40,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:06:40,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:06:40,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:06:40,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:06:40,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:06:40,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:06:40,848 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:06:40,931 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:06:40,933 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:06:41,339 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:06:41,339 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:06:41,601 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:06:41,602 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:06:41,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:06:41 BoogieIcfgContainer [2025-03-04 10:06:41,603 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:06:41,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:06:41,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:06:41,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:06:41,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:06:40" (1/3) ... [2025-03-04 10:06:41,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3275cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:06:41, skipping insertion in model container [2025-03-04 10:06:41,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:40" (2/3) ... [2025-03-04 10:06:41,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3275cd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:06:41, skipping insertion in model container [2025-03-04 10:06:41,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:06:41" (3/3) ... [2025-03-04 10:06:41,611 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-trans.wvr.c [2025-03-04 10:06:41,623 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:06:41,624 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-trans.wvr.c that has 4 procedures, 55 locations, 1 initial locations, 6 loop locations, and 20 error locations. [2025-03-04 10:06:41,624 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:06:41,699 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 10:06:41,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 60 transitions, 141 flow [2025-03-04 10:06:41,747 INFO L124 PetriNetUnfolderBase]: 6/57 cut-off events. [2025-03-04 10:06:41,750 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:06:41,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 57 events. 6/57 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 139 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-03-04 10:06:41,754 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 60 transitions, 141 flow [2025-03-04 10:06:41,756 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 56 transitions, 130 flow [2025-03-04 10:06:41,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:06:41,769 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;@6c11b74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:06:41,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-03-04 10:06:41,774 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:06:41,774 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:06:41,775 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:06:41,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:41,775 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:06:41,775 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:41,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:41,779 INFO L85 PathProgramCache]: Analyzing trace with hash 764262, now seen corresponding path program 1 times [2025-03-04 10:06:41,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:41,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408394680] [2025-03-04 10:06:41,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:41,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:41,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:06:41,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:06:41,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:41,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:41,953 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-04 10:06:41,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:41,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408394680] [2025-03-04 10:06:41,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408394680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:41,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:41,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:06:41,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028822765] [2025-03-04 10:06:41,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:41,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:06:41,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:41,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:06:41,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:06:42,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-04 10:06:42,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:42,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:42,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-04 10:06:42,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:42,141 INFO L124 PetriNetUnfolderBase]: 202/407 cut-off events. [2025-03-04 10:06:42,142 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-04 10:06:42,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 407 events. 202/407 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1720 event pairs, 124 based on Foata normal form. 1/330 useless extension candidates. Maximal degree in co-relation 636. Up to 293 conditions per place. [2025-03-04 10:06:42,146 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 27 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2025-03-04 10:06:42,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 178 flow [2025-03-04 10:06:42,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:06:42,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:06:42,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-03-04 10:06:42,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2025-03-04 10:06:42,157 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 130 flow. Second operand 3 states and 111 transitions. [2025-03-04 10:06:42,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 178 flow [2025-03-04 10:06:42,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 166 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:06:42,163 INFO L231 Difference]: Finished difference. Result has 51 places, 51 transitions, 112 flow [2025-03-04 10:06:42,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=51, PETRI_TRANSITIONS=51} [2025-03-04 10:06:42,166 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2025-03-04 10:06:42,167 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 51 transitions, 112 flow [2025-03-04 10:06:42,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:42,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:42,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:06:42,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:06:42,167 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:42,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:42,168 INFO L85 PathProgramCache]: Analyzing trace with hash 764263, now seen corresponding path program 1 times [2025-03-04 10:06:42,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:42,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305359743] [2025-03-04 10:06:42,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:42,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:42,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:06:42,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:06:42,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:42,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:42,376 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-04 10:06:42,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:42,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305359743] [2025-03-04 10:06:42,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305359743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:42,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:42,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:06:42,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704946718] [2025-03-04 10:06:42,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:42,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:06:42,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:42,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:06:42,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:06:42,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-04 10:06:42,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 51 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-04 10:06:42,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:42,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-04 10:06:42,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:42,588 INFO L124 PetriNetUnfolderBase]: 205/416 cut-off events. [2025-03-04 10:06:42,589 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:06:42,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 416 events. 205/416 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1755 event pairs, 124 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 698. Up to 306 conditions per place. [2025-03-04 10:06:42,593 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 34 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2025-03-04 10:06:42,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 214 flow [2025-03-04 10:06:42,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:06:42,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:06:42,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-03-04 10:06:42,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2025-03-04 10:06:42,597 INFO L175 Difference]: Start difference. First operand has 51 places, 51 transitions, 112 flow. Second operand 3 states and 122 transitions. [2025-03-04 10:06:42,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 214 flow [2025-03-04 10:06:42,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:06:42,601 INFO L231 Difference]: Finished difference. Result has 53 places, 57 transitions, 166 flow [2025-03-04 10:06:42,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=53, PETRI_TRANSITIONS=57} [2025-03-04 10:06:42,601 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2025-03-04 10:06:42,602 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 57 transitions, 166 flow [2025-03-04 10:06:42,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-04 10:06:42,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:42,602 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:06:42,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:06:42,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:42,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:42,603 INFO L85 PathProgramCache]: Analyzing trace with hash 734480075, now seen corresponding path program 1 times [2025-03-04 10:06:42,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:42,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213523823] [2025-03-04 10:06:42,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:42,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:42,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:06:42,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:06:42,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:42,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:42,776 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-04 10:06:42,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:42,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213523823] [2025-03-04 10:06:42,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213523823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:42,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330403358] [2025-03-04 10:06:42,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:42,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:42,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:42,780 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-04 10:06:42,782 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-04 10:06:42,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:06:42,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:06:42,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:42,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:42,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:06:42,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:42,875 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 6 treesize of output 5 [2025-03-04 10:06:42,909 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-04 10:06:42,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:42,970 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-04 10:06:42,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330403358] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:42,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:42,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2025-03-04 10:06:42,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025959623] [2025-03-04 10:06:42,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:42,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:06:42,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:42,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:06:42,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:06:43,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-04 10:06:43,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 57 transitions, 166 flow. Second operand has 9 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 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-04 10:06:43,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:43,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-04 10:06:43,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:43,345 INFO L124 PetriNetUnfolderBase]: 208/437 cut-off events. [2025-03-04 10:06:43,345 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 10:06:43,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 437 events. 208/437 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1778 event pairs, 124 based on Foata normal form. 6/365 useless extension candidates. Maximal degree in co-relation 730. Up to 307 conditions per place. [2025-03-04 10:06:43,348 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 41 selfloop transitions, 21 changer transitions 0/81 dead transitions. [2025-03-04 10:06:43,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 81 transitions, 368 flow [2025-03-04 10:06:43,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:06:43,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:06:43,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 233 transitions. [2025-03-04 10:06:43,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6472222222222223 [2025-03-04 10:06:43,352 INFO L175 Difference]: Start difference. First operand has 53 places, 57 transitions, 166 flow. Second operand 6 states and 233 transitions. [2025-03-04 10:06:43,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 81 transitions, 368 flow [2025-03-04 10:06:43,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 81 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:06:43,354 INFO L231 Difference]: Finished difference. Result has 59 places, 69 transitions, 292 flow [2025-03-04 10:06:43,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=51, 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=292, PETRI_PLACES=59, PETRI_TRANSITIONS=69} [2025-03-04 10:06:43,354 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2025-03-04 10:06:43,354 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 69 transitions, 292 flow [2025-03-04 10:06:43,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 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-04 10:06:43,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:43,356 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-04 10:06:43,365 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-04 10:06:43,557 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-04 10:06:43,557 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:43,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:43,557 INFO L85 PathProgramCache]: Analyzing trace with hash -419927817, now seen corresponding path program 2 times [2025-03-04 10:06:43,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:43,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163458750] [2025-03-04 10:06:43,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:06:43,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:43,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 10:06:43,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:06:43,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:06:43,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:43,821 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:43,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:43,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163458750] [2025-03-04 10:06:43,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163458750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:43,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944620986] [2025-03-04 10:06:43,822 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:06:43,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:43,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:43,825 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-04 10:06:43,825 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-04 10:06:43,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 10:06:43,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:06:43,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:06:43,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:43,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:06:43,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:43,886 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 6 treesize of output 5 [2025-03-04 10:06:44,020 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:44,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:44,220 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:44,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944620986] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:44,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:44,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2025-03-04 10:06:44,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753012014] [2025-03-04 10:06:44,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:44,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:06:44,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:44,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:06:44,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:06:44,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-04 10:06:44,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 69 transitions, 292 flow. Second operand has 19 states, 19 states have (on average 27.68421052631579) internal successors, (526), 19 states have internal predecessors, (526), 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-04 10:06:44,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:44,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-04 10:06:44,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:44,790 INFO L124 PetriNetUnfolderBase]: 208/434 cut-off events. [2025-03-04 10:06:44,790 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-03-04 10:06:44,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 850 conditions, 434 events. 208/434 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1757 event pairs, 124 based on Foata normal form. 3/362 useless extension candidates. Maximal degree in co-relation 762. Up to 295 conditions per place. [2025-03-04 10:06:44,793 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 22 selfloop transitions, 37 changer transitions 0/78 dead transitions. [2025-03-04 10:06:44,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 78 transitions, 404 flow [2025-03-04 10:06:44,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:06:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:06:44,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 348 transitions. [2025-03-04 10:06:44,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5272727272727272 [2025-03-04 10:06:44,795 INFO L175 Difference]: Start difference. First operand has 59 places, 69 transitions, 292 flow. Second operand 11 states and 348 transitions. [2025-03-04 10:06:44,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 78 transitions, 404 flow [2025-03-04 10:06:44,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 78 transitions, 330 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-03-04 10:06:44,797 INFO L231 Difference]: Finished difference. Result has 61 places, 78 transitions, 292 flow [2025-03-04 10:06:44,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=292, PETRI_PLACES=61, PETRI_TRANSITIONS=78} [2025-03-04 10:06:44,798 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2025-03-04 10:06:44,798 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 78 transitions, 292 flow [2025-03-04 10:06:44,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 27.68421052631579) internal successors, (526), 19 states have internal predecessors, (526), 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-04 10:06:44,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:44,798 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:44,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:06:44,999 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,SelfDestructingSolverStorable3 [2025-03-04 10:06:44,999 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:44,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:44,999 INFO L85 PathProgramCache]: Analyzing trace with hash -189998543, now seen corresponding path program 1 times [2025-03-04 10:06:45,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:45,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863475472] [2025-03-04 10:06:45,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:45,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:45,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:06:45,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:06:45,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:45,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:45,129 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:06:45,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:45,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863475472] [2025-03-04 10:06:45,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863475472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:45,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724134418] [2025-03-04 10:06:45,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:45,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:45,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:45,131 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-04 10:06:45,132 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-04 10:06:45,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:06:45,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:06:45,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:45,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:45,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:06:45,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:45,234 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:06:45,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:45,268 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:06:45,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724134418] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:45,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:45,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 10:06:45,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749902893] [2025-03-04 10:06:45,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:45,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:06:45,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:45,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:06:45,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:06:45,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 60 [2025-03-04 10:06:45,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 78 transitions, 292 flow. Second operand has 11 states, 11 states have (on average 31.363636363636363) internal successors, (345), 11 states have internal predecessors, (345), 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-04 10:06:45,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:45,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 60 [2025-03-04 10:06:45,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:45,435 INFO L124 PetriNetUnfolderBase]: 202/431 cut-off events. [2025-03-04 10:06:45,435 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:06:45,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 431 events. 202/431 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1704 event pairs, 124 based on Foata normal form. 9/365 useless extension candidates. Maximal degree in co-relation 698. Up to 296 conditions per place. [2025-03-04 10:06:45,437 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 35 selfloop transitions, 21 changer transitions 0/75 dead transitions. [2025-03-04 10:06:45,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 75 transitions, 380 flow [2025-03-04 10:06:45,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:06:45,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:06:45,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 268 transitions. [2025-03-04 10:06:45,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2025-03-04 10:06:45,439 INFO L175 Difference]: Start difference. First operand has 61 places, 78 transitions, 292 flow. Second operand 7 states and 268 transitions. [2025-03-04 10:06:45,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 75 transitions, 380 flow [2025-03-04 10:06:45,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 75 transitions, 340 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-04 10:06:45,441 INFO L231 Difference]: Finished difference. Result has 63 places, 75 transitions, 296 flow [2025-03-04 10:06:45,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=296, PETRI_PLACES=63, PETRI_TRANSITIONS=75} [2025-03-04 10:06:45,441 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 3 predicate places. [2025-03-04 10:06:45,441 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 75 transitions, 296 flow [2025-03-04 10:06:45,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 31.363636363636363) internal successors, (345), 11 states have internal predecessors, (345), 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-04 10:06:45,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:45,442 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:45,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:06:45,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:45,643 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:45,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:45,643 INFO L85 PathProgramCache]: Analyzing trace with hash -267616590, now seen corresponding path program 1 times [2025-03-04 10:06:45,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:45,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673138017] [2025-03-04 10:06:45,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:45,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:45,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:06:45,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:06:45,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:45,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:46,566 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 24 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:46,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:46,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673138017] [2025-03-04 10:06:46,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673138017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:46,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073809276] [2025-03-04 10:06:46,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:46,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:46,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:46,569 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-04 10:06:46,571 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-04 10:06:46,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:06:46,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:06:46,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:46,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:46,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 10:06:46,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:46,675 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-04 10:06:46,678 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 6 treesize of output 5 [2025-03-04 10:06:46,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:06:46,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:06:46,762 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 10:06:46,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 10:06:46,843 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:06:46,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 10:06:46,855 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:06:46,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:06:47,173 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:47,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:47,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073809276] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:47,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:06:47,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14, 9] total 32 [2025-03-04 10:06:47,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832498494] [2025-03-04 10:06:47,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:47,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:06:47,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:47,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:06:47,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:06:48,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-04 10:06:48,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 75 transitions, 296 flow. Second operand has 11 states, 11 states have (on average 27.90909090909091) internal successors, (307), 11 states have internal predecessors, (307), 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-04 10:06:48,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:48,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-04 10:06:48,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:48,550 INFO L124 PetriNetUnfolderBase]: 578/1087 cut-off events. [2025-03-04 10:06:48,550 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 10:06:48,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2062 conditions, 1087 events. 578/1087 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5633 event pairs, 221 based on Foata normal form. 0/959 useless extension candidates. Maximal degree in co-relation 1917. Up to 440 conditions per place. [2025-03-04 10:06:48,554 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 71 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2025-03-04 10:06:48,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 93 transitions, 491 flow [2025-03-04 10:06:48,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:06:48,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:06:48,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2025-03-04 10:06:48,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.575 [2025-03-04 10:06:48,556 INFO L175 Difference]: Start difference. First operand has 63 places, 75 transitions, 296 flow. Second operand 6 states and 207 transitions. [2025-03-04 10:06:48,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 93 transitions, 491 flow [2025-03-04 10:06:48,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 93 transitions, 458 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:06:48,558 INFO L231 Difference]: Finished difference. Result has 65 places, 76 transitions, 288 flow [2025-03-04 10:06:48,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=288, PETRI_PLACES=65, PETRI_TRANSITIONS=76} [2025-03-04 10:06:48,562 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2025-03-04 10:06:48,562 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 76 transitions, 288 flow [2025-03-04 10:06:48,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.90909090909091) internal successors, (307), 11 states have internal predecessors, (307), 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-04 10:06:48,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:48,562 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:48,568 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-04 10:06:48,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:48,763 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:48,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:48,763 INFO L85 PathProgramCache]: Analyzing trace with hash -267616591, now seen corresponding path program 2 times [2025-03-04 10:06:48,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:48,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845635704] [2025-03-04 10:06:48,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:06:48,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:48,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 10:06:48,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 38 statements. [2025-03-04 10:06:48,792 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:06:48,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:48,879 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-04 10:06:48,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:48,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845635704] [2025-03-04 10:06:48,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845635704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:48,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:48,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:06:48,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093832170] [2025-03-04 10:06:48,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:48,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:06:48,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:48,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:06:48,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:06:48,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-04 10:06:48,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 76 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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-04 10:06:48,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:48,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-04 10:06:48,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:49,009 INFO L124 PetriNetUnfolderBase]: 504/916 cut-off events. [2025-03-04 10:06:49,010 INFO L125 PetriNetUnfolderBase]: For 334/349 co-relation queries the response was YES. [2025-03-04 10:06:49,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2004 conditions, 916 events. 504/916 cut-off events. For 334/349 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4190 event pairs, 357 based on Foata normal form. 63/899 useless extension candidates. Maximal degree in co-relation 1872. Up to 730 conditions per place. [2025-03-04 10:06:49,015 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 56 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2025-03-04 10:06:49,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 74 transitions, 402 flow [2025-03-04 10:06:49,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:06:49,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:06:49,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2025-03-04 10:06:49,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4766666666666667 [2025-03-04 10:06:49,018 INFO L175 Difference]: Start difference. First operand has 65 places, 76 transitions, 288 flow. Second operand 5 states and 143 transitions. [2025-03-04 10:06:49,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 74 transitions, 402 flow [2025-03-04 10:06:49,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 74 transitions, 394 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:06:49,022 INFO L231 Difference]: Finished difference. Result has 63 places, 74 transitions, 282 flow [2025-03-04 10:06:49,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=63, PETRI_TRANSITIONS=74} [2025-03-04 10:06:49,024 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 3 predicate places. [2025-03-04 10:06:49,024 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 74 transitions, 282 flow [2025-03-04 10:06:49,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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-04 10:06:49,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:49,024 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:49,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:06:49,024 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:49,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:49,024 INFO L85 PathProgramCache]: Analyzing trace with hash 293820995, now seen corresponding path program 1 times [2025-03-04 10:06:49,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:49,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211908299] [2025-03-04 10:06:49,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:49,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:49,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 10:06:49,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:06:49,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:49,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:49,163 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-04 10:06:49,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:49,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211908299] [2025-03-04 10:06:49,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211908299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:49,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:49,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:06:49,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068261606] [2025-03-04 10:06:49,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:49,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:06:49,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:49,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:06:49,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:06:49,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 60 [2025-03-04 10:06:49,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 74 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 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-04 10:06:49,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:49,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 60 [2025-03-04 10:06:49,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:49,329 INFO L124 PetriNetUnfolderBase]: 416/806 cut-off events. [2025-03-04 10:06:49,329 INFO L125 PetriNetUnfolderBase]: For 140/169 co-relation queries the response was YES. [2025-03-04 10:06:49,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1655 conditions, 806 events. 416/806 cut-off events. For 140/169 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3913 event pairs, 315 based on Foata normal form. 31/751 useless extension candidates. Maximal degree in co-relation 1523. Up to 616 conditions per place. [2025-03-04 10:06:49,333 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 54 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2025-03-04 10:06:49,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 392 flow [2025-03-04 10:06:49,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:06:49,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:06:49,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2025-03-04 10:06:49,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49 [2025-03-04 10:06:49,335 INFO L175 Difference]: Start difference. First operand has 63 places, 74 transitions, 282 flow. Second operand 5 states and 147 transitions. [2025-03-04 10:06:49,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 392 flow [2025-03-04 10:06:49,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 387 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:06:49,336 INFO L231 Difference]: Finished difference. Result has 62 places, 72 transitions, 279 flow [2025-03-04 10:06:49,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=279, PETRI_PLACES=62, PETRI_TRANSITIONS=72} [2025-03-04 10:06:49,337 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 2 predicate places. [2025-03-04 10:06:49,337 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 72 transitions, 279 flow [2025-03-04 10:06:49,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 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-04 10:06:49,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:49,337 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:49,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:06:49,337 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:49,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:49,338 INFO L85 PathProgramCache]: Analyzing trace with hash 293820996, now seen corresponding path program 1 times [2025-03-04 10:06:49,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:49,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479692753] [2025-03-04 10:06:49,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:49,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:49,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 10:06:49,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:06:49,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:49,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:49,648 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:49,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:49,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479692753] [2025-03-04 10:06:49,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479692753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:49,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528047602] [2025-03-04 10:06:49,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:49,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:49,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:49,651 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-04 10:06:49,652 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-04 10:06:49,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 10:06:49,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:06:49,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:49,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:49,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 10:06:49,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:49,754 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 6 treesize of output 5 [2025-03-04 10:06:49,760 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-04 10:06:49,809 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:06:49,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:06:49,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:06:50,039 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:50,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:50,334 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:50,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528047602] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:50,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:06:50,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 24 [2025-03-04 10:06:50,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428033401] [2025-03-04 10:06:50,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:50,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:06:50,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:50,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:06:50,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:06:50,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-03-04 10:06:50,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 72 transitions, 279 flow. Second operand has 10 states, 10 states have (on average 30.1) internal successors, (301), 10 states have internal predecessors, (301), 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-04 10:06:50,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:50,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-03-04 10:06:50,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:50,740 INFO L124 PetriNetUnfolderBase]: 400/753 cut-off events. [2025-03-04 10:06:50,740 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2025-03-04 10:06:50,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1620 conditions, 753 events. 400/753 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3324 event pairs, 169 based on Foata normal form. 26/707 useless extension candidates. Maximal degree in co-relation 1488. Up to 377 conditions per place. [2025-03-04 10:06:50,745 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 69 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2025-03-04 10:06:50,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 469 flow [2025-03-04 10:06:50,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:06:50,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:06:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2025-03-04 10:06:50,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 10:06:50,747 INFO L175 Difference]: Start difference. First operand has 62 places, 72 transitions, 279 flow. Second operand 6 states and 216 transitions. [2025-03-04 10:06:50,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 469 flow [2025-03-04 10:06:50,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 89 transitions, 464 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:06:50,749 INFO L231 Difference]: Finished difference. Result has 65 places, 73 transitions, 295 flow [2025-03-04 10:06:50,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=295, PETRI_PLACES=65, PETRI_TRANSITIONS=73} [2025-03-04 10:06:50,750 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2025-03-04 10:06:50,750 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 73 transitions, 295 flow [2025-03-04 10:06:50,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 30.1) internal successors, (301), 10 states have internal predecessors, (301), 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-04 10:06:50,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:50,751 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:50,759 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-04 10:06:50,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:50,952 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:50,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:50,952 INFO L85 PathProgramCache]: Analyzing trace with hash 484352629, now seen corresponding path program 1 times [2025-03-04 10:06:50,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:50,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793745823] [2025-03-04 10:06:50,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:50,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:50,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:06:50,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:06:50,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:50,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:51,303 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:51,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:51,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793745823] [2025-03-04 10:06:51,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793745823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:51,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372854327] [2025-03-04 10:06:51,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:51,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:51,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:51,306 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-04 10:06:51,307 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-04 10:06:51,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:06:51,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:06:51,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:51,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:51,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 10:06:51,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:51,414 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 6 treesize of output 5 [2025-03-04 10:06:51,417 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-04 10:06:51,480 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:06:51,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 10:06:51,490 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:06:51,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:06:51,736 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:51,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:51,987 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:51,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372854327] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:51,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:06:51,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 25 [2025-03-04 10:06:51,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429963816] [2025-03-04 10:06:51,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:51,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:06:51,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:51,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:06:51,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:06:52,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-03-04 10:06:52,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 73 transitions, 295 flow. Second operand has 10 states, 10 states have (on average 29.3) internal successors, (293), 10 states have internal predecessors, (293), 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-04 10:06:52,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:52,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-03-04 10:06:52,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:52,432 INFO L124 PetriNetUnfolderBase]: 775/1400 cut-off events. [2025-03-04 10:06:52,432 INFO L125 PetriNetUnfolderBase]: For 937/1040 co-relation queries the response was YES. [2025-03-04 10:06:52,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3198 conditions, 1400 events. 775/1400 cut-off events. For 937/1040 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7396 event pairs, 315 based on Foata normal form. 0/1228 useless extension candidates. Maximal degree in co-relation 3065. Up to 604 conditions per place. [2025-03-04 10:06:52,439 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 69 selfloop transitions, 6 changer transitions 0/89 dead transitions. [2025-03-04 10:06:52,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 89 transitions, 498 flow [2025-03-04 10:06:52,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:06:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:06:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2025-03-04 10:06:52,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5805555555555556 [2025-03-04 10:06:52,441 INFO L175 Difference]: Start difference. First operand has 65 places, 73 transitions, 295 flow. Second operand 6 states and 209 transitions. [2025-03-04 10:06:52,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 89 transitions, 498 flow [2025-03-04 10:06:52,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 89 transitions, 488 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:06:52,444 INFO L231 Difference]: Finished difference. Result has 68 places, 74 transitions, 312 flow [2025-03-04 10:06:52,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=68, PETRI_TRANSITIONS=74} [2025-03-04 10:06:52,445 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2025-03-04 10:06:52,445 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 74 transitions, 312 flow [2025-03-04 10:06:52,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 29.3) internal successors, (293), 10 states have internal predecessors, (293), 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-04 10:06:52,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:52,445 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:52,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:06:52,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:52,646 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:52,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:52,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2130030313, now seen corresponding path program 1 times [2025-03-04 10:06:52,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:52,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465125985] [2025-03-04 10:06:52,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:52,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:52,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 10:06:52,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:06:52,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:52,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 10:06:52,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:52,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465125985] [2025-03-04 10:06:52,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465125985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:52,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:52,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:06:52,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612283042] [2025-03-04 10:06:52,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:52,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:06:52,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:52,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:06:52,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:06:52,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-04 10:06:52,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 74 transitions, 312 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 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-04 10:06:52,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:52,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-04 10:06:52,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:52,882 INFO L124 PetriNetUnfolderBase]: 525/985 cut-off events. [2025-03-04 10:06:52,882 INFO L125 PetriNetUnfolderBase]: For 726/818 co-relation queries the response was YES. [2025-03-04 10:06:52,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2461 conditions, 985 events. 525/985 cut-off events. For 726/818 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4784 event pairs, 406 based on Foata normal form. 31/935 useless extension candidates. Maximal degree in co-relation 2326. Up to 773 conditions per place. [2025-03-04 10:06:52,887 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 55 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2025-03-04 10:06:52,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 72 transitions, 422 flow [2025-03-04 10:06:52,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:06:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:06:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2025-03-04 10:06:52,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5291666666666667 [2025-03-04 10:06:52,889 INFO L175 Difference]: Start difference. First operand has 68 places, 74 transitions, 312 flow. Second operand 4 states and 127 transitions. [2025-03-04 10:06:52,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 72 transitions, 422 flow [2025-03-04 10:06:52,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 72 transitions, 414 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:06:52,891 INFO L231 Difference]: Finished difference. Result has 65 places, 72 transitions, 304 flow [2025-03-04 10:06:52,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=65, PETRI_TRANSITIONS=72} [2025-03-04 10:06:52,892 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2025-03-04 10:06:52,892 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 72 transitions, 304 flow [2025-03-04 10:06:52,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 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-04 10:06:52,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:52,893 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:52,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:06:52,893 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:52,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:52,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2130030314, now seen corresponding path program 1 times [2025-03-04 10:06:52,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:52,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804300402] [2025-03-04 10:06:52,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:52,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:52,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 10:06:52,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:06:52,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:52,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:53,186 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:53,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:53,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804300402] [2025-03-04 10:06:53,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804300402] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:53,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969107039] [2025-03-04 10:06:53,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:53,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:53,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:53,188 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-04 10:06:53,189 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-04 10:06:53,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 10:06:53,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:06:53,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:53,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:53,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:06:53,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:53,410 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:53,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:53,464 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-04 10:06:53,540 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:53,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969107039] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:53,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:53,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-04 10:06:53,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950427132] [2025-03-04 10:06:53,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:53,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 10:06:53,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:53,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 10:06:53,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:06:53,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-03-04 10:06:53,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 72 transitions, 304 flow. Second operand has 25 states, 25 states have (on average 30.24) internal successors, (756), 25 states have internal predecessors, (756), 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-04 10:06:53,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:53,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-03-04 10:06:53,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:54,336 INFO L124 PetriNetUnfolderBase]: 888/1668 cut-off events. [2025-03-04 10:06:54,336 INFO L125 PetriNetUnfolderBase]: For 1019/1138 co-relation queries the response was YES. [2025-03-04 10:06:54,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4128 conditions, 1668 events. 888/1668 cut-off events. For 1019/1138 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9233 event pairs, 315 based on Foata normal form. 92/1670 useless extension candidates. Maximal degree in co-relation 3994. Up to 650 conditions per place. [2025-03-04 10:06:54,345 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 71 selfloop transitions, 19 changer transitions 0/104 dead transitions. [2025-03-04 10:06:54,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 104 transitions, 592 flow [2025-03-04 10:06:54,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:06:54,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:06:54,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 366 transitions. [2025-03-04 10:06:54,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61 [2025-03-04 10:06:54,347 INFO L175 Difference]: Start difference. First operand has 65 places, 72 transitions, 304 flow. Second operand 10 states and 366 transitions. [2025-03-04 10:06:54,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 104 transitions, 592 flow [2025-03-04 10:06:54,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 104 transitions, 589 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:06:54,349 INFO L231 Difference]: Finished difference. Result has 74 places, 74 transitions, 359 flow [2025-03-04 10:06:54,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=359, PETRI_PLACES=74, PETRI_TRANSITIONS=74} [2025-03-04 10:06:54,350 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 14 predicate places. [2025-03-04 10:06:54,350 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 74 transitions, 359 flow [2025-03-04 10:06:54,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 30.24) internal successors, (756), 25 states have internal predecessors, (756), 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-04 10:06:54,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:54,350 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:54,357 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-04 10:06:54,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:54,551 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:54,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:54,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1105839415, now seen corresponding path program 1 times [2025-03-04 10:06:54,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:54,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376175175] [2025-03-04 10:06:54,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:54,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:54,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 10:06:54,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:06:54,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:54,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 29 proven. 23 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:06:55,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:55,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376175175] [2025-03-04 10:06:55,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376175175] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:55,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078756968] [2025-03-04 10:06:55,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:55,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:55,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:55,105 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-04 10:06:55,106 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-04 10:06:55,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 10:06:55,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:06:55,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:55,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:55,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-04 10:06:55,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:55,244 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 6 treesize of output 5 [2025-03-04 10:06:55,288 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 10:06:55,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 10:06:55,293 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 6 treesize of output 5 [2025-03-04 10:06:55,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:06:55,386 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 10:06:55,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2025-03-04 10:06:55,395 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:06:55,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:06:55,731 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:55,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:56,027 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 10 treesize of output 8 [2025-03-04 10:06:56,141 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:56,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078756968] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:56,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:56,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 34 [2025-03-04 10:06:56,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159337697] [2025-03-04 10:06:56,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:56,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 10:06:56,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:56,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 10:06:56,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=956, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:06:57,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2025-03-04 10:06:57,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 74 transitions, 359 flow. Second operand has 36 states, 36 states have (on average 20.13888888888889) internal successors, (725), 36 states have internal predecessors, (725), 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-04 10:06:57,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:57,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2025-03-04 10:06:57,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:58,467 INFO L124 PetriNetUnfolderBase]: 3065/5319 cut-off events. [2025-03-04 10:06:58,467 INFO L125 PetriNetUnfolderBase]: For 5734/5900 co-relation queries the response was YES. [2025-03-04 10:06:58,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14259 conditions, 5319 events. 3065/5319 cut-off events. For 5734/5900 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 34305 event pairs, 541 based on Foata normal form. 216/5484 useless extension candidates. Maximal degree in co-relation 14080. Up to 1012 conditions per place. [2025-03-04 10:06:58,505 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 123 selfloop transitions, 27 changer transitions 0/161 dead transitions. [2025-03-04 10:06:58,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 161 transitions, 999 flow [2025-03-04 10:06:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 10:06:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 10:06:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 503 transitions. [2025-03-04 10:06:58,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4191666666666667 [2025-03-04 10:06:58,508 INFO L175 Difference]: Start difference. First operand has 74 places, 74 transitions, 359 flow. Second operand 20 states and 503 transitions. [2025-03-04 10:06:58,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 161 transitions, 999 flow [2025-03-04 10:06:58,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 161 transitions, 966 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:06:58,516 INFO L231 Difference]: Finished difference. Result has 92 places, 82 transitions, 464 flow [2025-03-04 10:06:58,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=464, PETRI_PLACES=92, PETRI_TRANSITIONS=82} [2025-03-04 10:06:58,516 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 32 predicate places. [2025-03-04 10:06:58,517 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 82 transitions, 464 flow [2025-03-04 10:06:58,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 20.13888888888889) internal successors, (725), 36 states have internal predecessors, (725), 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-04 10:06:58,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:58,518 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:58,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:06:58,718 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,SelfDestructingSolverStorable12 [2025-03-04 10:06:58,718 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:58,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:58,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1566397821, now seen corresponding path program 1 times [2025-03-04 10:06:58,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:58,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838722956] [2025-03-04 10:06:58,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:58,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:58,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:06:58,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:06:58,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:58,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:59,115 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 24 proven. 14 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 10:06:59,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:59,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838722956] [2025-03-04 10:06:59,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838722956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:59,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074517058] [2025-03-04 10:06:59,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:59,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:59,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:59,118 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-04 10:06:59,119 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-04 10:06:59,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:06:59,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:06:59,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:59,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:59,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 10:06:59,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:59,236 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 6 treesize of output 5 [2025-03-04 10:06:59,241 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-04 10:06:59,309 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 10:06:59,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 10:06:59,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:06:59,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:06:59,543 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:06:59,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2025-03-04 10:06:59,552 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:06:59,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:06:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:59,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:00,106 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:00,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074517058] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:00,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:07:00,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 26 [2025-03-04 10:07:00,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392552656] [2025-03-04 10:07:00,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:00,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:07:00,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:00,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:07:00,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:07:00,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-04 10:07:00,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 82 transitions, 464 flow. Second operand has 11 states, 11 states have (on average 28.272727272727273) internal successors, (311), 11 states have internal predecessors, (311), 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-04 10:07:00,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:00,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-04 10:07:00,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:01,359 INFO L124 PetriNetUnfolderBase]: 4725/7971 cut-off events. [2025-03-04 10:07:01,360 INFO L125 PetriNetUnfolderBase]: For 14887/15350 co-relation queries the response was YES. [2025-03-04 10:07:01,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22899 conditions, 7971 events. 4725/7971 cut-off events. For 14887/15350 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 54398 event pairs, 2389 based on Foata normal form. 0/7628 useless extension candidates. Maximal degree in co-relation 22710. Up to 3942 conditions per place. [2025-03-04 10:07:01,397 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 85 selfloop transitions, 7 changer transitions 0/103 dead transitions. [2025-03-04 10:07:01,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 103 transitions, 774 flow [2025-03-04 10:07:01,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:07:01,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:07:01,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2025-03-04 10:07:01,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5638888888888889 [2025-03-04 10:07:01,399 INFO L175 Difference]: Start difference. First operand has 92 places, 82 transitions, 464 flow. Second operand 6 states and 203 transitions. [2025-03-04 10:07:01,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 103 transitions, 774 flow [2025-03-04 10:07:01,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 103 transitions, 769 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:01,408 INFO L231 Difference]: Finished difference. Result has 97 places, 83 transitions, 488 flow [2025-03-04 10:07:01,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=488, PETRI_PLACES=97, PETRI_TRANSITIONS=83} [2025-03-04 10:07:01,410 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 37 predicate places. [2025-03-04 10:07:01,410 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 83 transitions, 488 flow [2025-03-04 10:07:01,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.272727272727273) internal successors, (311), 11 states have internal predecessors, (311), 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-04 10:07:01,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:01,410 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:01,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:07:01,611 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,SelfDestructingSolverStorable13 [2025-03-04 10:07:01,611 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:07:01,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:01,612 INFO L85 PathProgramCache]: Analyzing trace with hash 78717197, now seen corresponding path program 1 times [2025-03-04 10:07:01,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:01,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165099605] [2025-03-04 10:07:01,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:01,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:01,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:07:01,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:07:01,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:01,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:01,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:01,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165099605] [2025-03-04 10:07:01,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165099605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:01,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756354410] [2025-03-04 10:07:01,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:01,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:01,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:01,953 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-04 10:07:01,954 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-04 10:07:02,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:07:02,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:07:02,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:02,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:02,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 10:07:02,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:02,068 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 6 treesize of output 5 [2025-03-04 10:07:02,072 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-04 10:07:02,136 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:07:02,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 10:07:02,146 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:07:02,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:07:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:02,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:02,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756354410] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:02,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:02,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2025-03-04 10:07:02,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301317793] [2025-03-04 10:07:02,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:02,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 10:07:02,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:02,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 10:07:02,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2025-03-04 10:07:03,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-04 10:07:03,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 83 transitions, 488 flow. Second operand has 29 states, 29 states have (on average 24.06896551724138) internal successors, (698), 29 states have internal predecessors, (698), 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-04 10:07:03,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:03,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-04 10:07:03,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:04,604 INFO L124 PetriNetUnfolderBase]: 2693/4930 cut-off events. [2025-03-04 10:07:04,604 INFO L125 PetriNetUnfolderBase]: For 9283/9579 co-relation queries the response was YES. [2025-03-04 10:07:04,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15401 conditions, 4930 events. 2693/4930 cut-off events. For 9283/9579 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 33594 event pairs, 701 based on Foata normal form. 258/5103 useless extension candidates. Maximal degree in co-relation 15207. Up to 1247 conditions per place. [2025-03-04 10:07:04,633 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 118 selfloop transitions, 22 changer transitions 0/156 dead transitions. [2025-03-04 10:07:04,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 156 transitions, 1071 flow [2025-03-04 10:07:04,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:07:04,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 10:07:04,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 499 transitions. [2025-03-04 10:07:04,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4892156862745098 [2025-03-04 10:07:04,635 INFO L175 Difference]: Start difference. First operand has 97 places, 83 transitions, 488 flow. Second operand 17 states and 499 transitions. [2025-03-04 10:07:04,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 156 transitions, 1071 flow [2025-03-04 10:07:04,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 156 transitions, 1049 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-04 10:07:04,649 INFO L231 Difference]: Finished difference. Result has 112 places, 84 transitions, 543 flow [2025-03-04 10:07:04,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=543, PETRI_PLACES=112, PETRI_TRANSITIONS=84} [2025-03-04 10:07:04,649 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 52 predicate places. [2025-03-04 10:07:04,649 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 84 transitions, 543 flow [2025-03-04 10:07:04,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 24.06896551724138) internal successors, (698), 29 states have internal predecessors, (698), 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-04 10:07:04,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:04,650 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:04,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:07:04,850 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,SelfDestructingSolverStorable14 [2025-03-04 10:07:04,850 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:07:04,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:04,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1740243185, now seen corresponding path program 1 times [2025-03-04 10:07:04,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:04,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312306588] [2025-03-04 10:07:04,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:04,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:04,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:07:04,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:07:04,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:04,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:05,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:05,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312306588] [2025-03-04 10:07:05,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312306588] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:05,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822197414] [2025-03-04 10:07:05,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:05,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:05,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:05,135 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-04 10:07:05,136 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-04 10:07:05,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:07:05,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:07:05,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:05,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:05,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 10:07:05,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:05,253 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-04 10:07:05,255 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 6 treesize of output 5 [2025-03-04 10:07:05,315 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:07:05,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:07:05,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:07:05,567 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:05,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:05,837 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:05,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822197414] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:05,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:05,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2025-03-04 10:07:05,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249872760] [2025-03-04 10:07:05,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:05,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 10:07:05,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:05,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 10:07:05,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2025-03-04 10:07:06,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-04 10:07:06,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 84 transitions, 543 flow. Second operand has 29 states, 29 states have (on average 23.379310344827587) internal successors, (678), 29 states have internal predecessors, (678), 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-04 10:07:06,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:06,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-04 10:07:06,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:07,992 INFO L124 PetriNetUnfolderBase]: 6040/10250 cut-off events. [2025-03-04 10:07:07,992 INFO L125 PetriNetUnfolderBase]: For 25486/26557 co-relation queries the response was YES. [2025-03-04 10:07:08,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32545 conditions, 10250 events. 6040/10250 cut-off events. For 25486/26557 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 71509 event pairs, 1150 based on Foata normal form. 471/10554 useless extension candidates. Maximal degree in co-relation 32335. Up to 2036 conditions per place. [2025-03-04 10:07:08,043 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 123 selfloop transitions, 23 changer transitions 0/160 dead transitions. [2025-03-04 10:07:08,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 160 transitions, 1297 flow [2025-03-04 10:07:08,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:07:08,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 10:07:08,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 478 transitions. [2025-03-04 10:07:08,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46862745098039216 [2025-03-04 10:07:08,045 INFO L175 Difference]: Start difference. First operand has 112 places, 84 transitions, 543 flow. Second operand 17 states and 478 transitions. [2025-03-04 10:07:08,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 160 transitions, 1297 flow [2025-03-04 10:07:08,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 160 transitions, 1245 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-04 10:07:08,064 INFO L231 Difference]: Finished difference. Result has 127 places, 86 transitions, 608 flow [2025-03-04 10:07:08,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=608, PETRI_PLACES=127, PETRI_TRANSITIONS=86} [2025-03-04 10:07:08,064 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 67 predicate places. [2025-03-04 10:07:08,065 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 86 transitions, 608 flow [2025-03-04 10:07:08,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 23.379310344827587) internal successors, (678), 29 states have internal predecessors, (678), 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-04 10:07:08,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:08,065 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:08,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:07:08,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:07:08,266 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:07:08,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:08,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1313692907, now seen corresponding path program 1 times [2025-03-04 10:07:08,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:08,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154288348] [2025-03-04 10:07:08,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:08,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:08,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:07:08,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:07:08,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:08,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:08,470 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:08,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:08,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154288348] [2025-03-04 10:07:08,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154288348] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:08,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625326289] [2025-03-04 10:07:08,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:08,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:08,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:08,473 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-04 10:07:08,474 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-04 10:07:08,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:07:08,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:07:08,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:08,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:08,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:07:08,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:08,693 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:08,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:08,749 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-04 10:07:08,817 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:08,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625326289] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:08,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:08,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-04 10:07:08,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253107391] [2025-03-04 10:07:08,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:08,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 10:07:08,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:08,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 10:07:08,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:07:09,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-03-04 10:07:09,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 86 transitions, 608 flow. Second operand has 25 states, 25 states have (on average 30.48) internal successors, (762), 25 states have internal predecessors, (762), 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-04 10:07:09,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:09,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-03-04 10:07:09,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:10,294 INFO L124 PetriNetUnfolderBase]: 6204/11437 cut-off events. [2025-03-04 10:07:10,294 INFO L125 PetriNetUnfolderBase]: For 30827/32011 co-relation queries the response was YES. [2025-03-04 10:07:10,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36398 conditions, 11437 events. 6204/11437 cut-off events. For 30827/32011 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 90735 event pairs, 2903 based on Foata normal form. 644/11626 useless extension candidates. Maximal degree in co-relation 36168. Up to 4940 conditions per place. [2025-03-04 10:07:10,359 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 89 selfloop transitions, 20 changer transitions 0/126 dead transitions. [2025-03-04 10:07:10,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 126 transitions, 1120 flow [2025-03-04 10:07:10,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:07:10,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:07:10,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 362 transitions. [2025-03-04 10:07:10,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6033333333333334 [2025-03-04 10:07:10,361 INFO L175 Difference]: Start difference. First operand has 127 places, 86 transitions, 608 flow. Second operand 10 states and 362 transitions. [2025-03-04 10:07:10,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 126 transitions, 1120 flow [2025-03-04 10:07:10,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 126 transitions, 1056 flow, removed 6 selfloop flow, removed 14 redundant places. [2025-03-04 10:07:10,387 INFO L231 Difference]: Finished difference. Result has 124 places, 88 transitions, 624 flow [2025-03-04 10:07:10,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=624, PETRI_PLACES=124, PETRI_TRANSITIONS=88} [2025-03-04 10:07:10,387 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 64 predicate places. [2025-03-04 10:07:10,387 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 88 transitions, 624 flow [2025-03-04 10:07:10,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 30.48) internal successors, (762), 25 states have internal predecessors, (762), 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-04 10:07:10,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:10,388 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:10,394 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-04 10:07:10,588 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,SelfDestructingSolverStorable16 [2025-03-04 10:07:10,588 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:07:10,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:10,589 INFO L85 PathProgramCache]: Analyzing trace with hash -261475856, now seen corresponding path program 1 times [2025-03-04 10:07:10,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:10,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386283618] [2025-03-04 10:07:10,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:10,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:10,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 10:07:10,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 10:07:10,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:10,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 29 proven. 23 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 10:07:11,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:11,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386283618] [2025-03-04 10:07:11,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386283618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:11,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559948024] [2025-03-04 10:07:11,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:11,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:11,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:11,217 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-04 10:07:11,217 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-04 10:07:11,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 10:07:11,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 10:07:11,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:11,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:11,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 10:07:11,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:11,336 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 6 treesize of output 5 [2025-03-04 10:07:11,340 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-04 10:07:11,392 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 10:07:11,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 10:07:11,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:07:11,445 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:07:11,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:07:11,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:07:11,713 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:11,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:12,149 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:12,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559948024] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:12,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:12,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 34 [2025-03-04 10:07:12,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393549502] [2025-03-04 10:07:12,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:12,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 10:07:12,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:12,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 10:07:12,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=941, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:07:13,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2025-03-04 10:07:13,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 88 transitions, 624 flow. Second operand has 36 states, 36 states have (on average 20.47222222222222) internal successors, (737), 36 states have internal predecessors, (737), 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-04 10:07:13,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:13,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2025-03-04 10:07:13,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:16,424 INFO L124 PetriNetUnfolderBase]: 17343/29246 cut-off events. [2025-03-04 10:07:16,424 INFO L125 PetriNetUnfolderBase]: For 81017/83389 co-relation queries the response was YES. [2025-03-04 10:07:16,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97951 conditions, 29246 events. 17343/29246 cut-off events. For 81017/83389 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 234699 event pairs, 4073 based on Foata normal form. 1296/30489 useless extension candidates. Maximal degree in co-relation 97719. Up to 6780 conditions per place. [2025-03-04 10:07:16,661 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 164 selfloop transitions, 24 changer transitions 0/200 dead transitions. [2025-03-04 10:07:16,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 200 transitions, 1782 flow [2025-03-04 10:07:16,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:07:16,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 10:07:16,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 453 transitions. [2025-03-04 10:07:16,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41944444444444445 [2025-03-04 10:07:16,662 INFO L175 Difference]: Start difference. First operand has 124 places, 88 transitions, 624 flow. Second operand 18 states and 453 transitions. [2025-03-04 10:07:16,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 200 transitions, 1782 flow [2025-03-04 10:07:16,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 200 transitions, 1749 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:07:16,732 INFO L231 Difference]: Finished difference. Result has 139 places, 91 transitions, 677 flow [2025-03-04 10:07:16,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=677, PETRI_PLACES=139, PETRI_TRANSITIONS=91} [2025-03-04 10:07:16,732 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 79 predicate places. [2025-03-04 10:07:16,732 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 91 transitions, 677 flow [2025-03-04 10:07:16,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 20.47222222222222) internal successors, (737), 36 states have internal predecessors, (737), 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-04 10:07:16,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:16,733 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:16,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 10:07:16,933 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,SelfDestructingSolverStorable17 [2025-03-04 10:07:16,933 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:07:16,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:16,934 INFO L85 PathProgramCache]: Analyzing trace with hash -112368342, now seen corresponding path program 1 times [2025-03-04 10:07:16,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:16,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595692407] [2025-03-04 10:07:16,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:16,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:16,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 10:07:16,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:07:16,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:16,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:17,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:17,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595692407] [2025-03-04 10:07:17,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595692407] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:17,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326107431] [2025-03-04 10:07:17,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:17,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:17,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:17,193 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:17,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:07:17,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 10:07:17,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:07:17,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:17,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:17,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 10:07:17,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:17,427 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:17,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:17,509 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-04 10:07:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:17,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326107431] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:17,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:17,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-03-04 10:07:17,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759013030] [2025-03-04 10:07:17,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:17,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 10:07:17,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:17,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 10:07:17,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:07:18,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-03-04 10:07:18,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 91 transitions, 677 flow. Second operand has 32 states, 32 states have (on average 29.96875) internal successors, (959), 32 states have internal predecessors, (959), 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-04 10:07:18,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:18,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-03-04 10:07:18,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:20,960 INFO L124 PetriNetUnfolderBase]: 10983/21059 cut-off events. [2025-03-04 10:07:20,960 INFO L125 PetriNetUnfolderBase]: For 70851/72782 co-relation queries the response was YES. [2025-03-04 10:07:21,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75448 conditions, 21059 events. 10983/21059 cut-off events. For 70851/72782 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 182332 event pairs, 2437 based on Foata normal form. 957/21613 useless extension candidates. Maximal degree in co-relation 75212. Up to 4518 conditions per place. [2025-03-04 10:07:21,154 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 162 selfloop transitions, 23 changer transitions 0/203 dead transitions. [2025-03-04 10:07:21,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 203 transitions, 1850 flow [2025-03-04 10:07:21,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:07:21,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 10:07:21,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 496 transitions. [2025-03-04 10:07:21,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6358974358974359 [2025-03-04 10:07:21,156 INFO L175 Difference]: Start difference. First operand has 139 places, 91 transitions, 677 flow. Second operand 13 states and 496 transitions. [2025-03-04 10:07:21,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 203 transitions, 1850 flow [2025-03-04 10:07:21,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 203 transitions, 1744 flow, removed 18 selfloop flow, removed 14 redundant places. [2025-03-04 10:07:21,267 INFO L231 Difference]: Finished difference. Result has 140 places, 93 transitions, 709 flow [2025-03-04 10:07:21,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=709, PETRI_PLACES=140, PETRI_TRANSITIONS=93} [2025-03-04 10:07:21,267 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 80 predicate places. [2025-03-04 10:07:21,267 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 93 transitions, 709 flow [2025-03-04 10:07:21,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 29.96875) internal successors, (959), 32 states have internal predecessors, (959), 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-04 10:07:21,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:21,267 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:21,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:07:21,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:21,468 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:07:21,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:21,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1819245003, now seen corresponding path program 1 times [2025-03-04 10:07:21,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:21,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666796419] [2025-03-04 10:07:21,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:21,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:21,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:07:21,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:07:21,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:21,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:22,002 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:22,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:22,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666796419] [2025-03-04 10:07:22,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666796419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:22,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389548936] [2025-03-04 10:07:22,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:22,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:22,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:22,005 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:22,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:07:22,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:07:22,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:07:22,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:22,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:22,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 10:07:22,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:22,300 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:22,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:22,403 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-04 10:07:22,492 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:22,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389548936] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:22,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:22,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-03-04 10:07:22,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592301311] [2025-03-04 10:07:22,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:22,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 10:07:22,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:22,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 10:07:22,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:07:23,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-03-04 10:07:23,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 93 transitions, 709 flow. Second operand has 32 states, 32 states have (on average 30.15625) internal successors, (965), 32 states have internal predecessors, (965), 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-04 10:07:23,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:23,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-03-04 10:07:23,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:25,915 INFO L124 PetriNetUnfolderBase]: 12849/24473 cut-off events. [2025-03-04 10:07:25,915 INFO L125 PetriNetUnfolderBase]: For 91567/93799 co-relation queries the response was YES. [2025-03-04 10:07:26,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88868 conditions, 24473 events. 12849/24473 cut-off events. For 91567/93799 co-relation queries the response was YES. Maximal size of possible extension queue 724. Compared 215156 event pairs, 3452 based on Foata normal form. 1143/25339 useless extension candidates. Maximal degree in co-relation 88629. Up to 5988 conditions per place. [2025-03-04 10:07:26,142 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 158 selfloop transitions, 23 changer transitions 0/199 dead transitions. [2025-03-04 10:07:26,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 199 transitions, 1929 flow [2025-03-04 10:07:26,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:07:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 10:07:26,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 486 transitions. [2025-03-04 10:07:26,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6230769230769231 [2025-03-04 10:07:26,144 INFO L175 Difference]: Start difference. First operand has 140 places, 93 transitions, 709 flow. Second operand 13 states and 486 transitions. [2025-03-04 10:07:26,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 199 transitions, 1929 flow [2025-03-04 10:07:26,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 199 transitions, 1860 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-04 10:07:26,277 INFO L231 Difference]: Finished difference. Result has 146 places, 94 transitions, 738 flow [2025-03-04 10:07:26,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=738, PETRI_PLACES=146, PETRI_TRANSITIONS=94} [2025-03-04 10:07:26,277 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 86 predicate places. [2025-03-04 10:07:26,277 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 94 transitions, 738 flow [2025-03-04 10:07:26,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 30.15625) internal successors, (965), 32 states have internal predecessors, (965), 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-04 10:07:26,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:26,278 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:26,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:26,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:26,478 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:07:26,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:26,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1574146062, now seen corresponding path program 2 times [2025-03-04 10:07:26,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:26,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836553759] [2025-03-04 10:07:26,479 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:26,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:26,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-04 10:07:26,514 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:07:26,514 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:26,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:26,827 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-04 10:07:26,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:26,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836553759] [2025-03-04 10:07:26,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836553759] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:26,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46453944] [2025-03-04 10:07:26,828 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:26,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:26,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:26,830 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:26,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:07:26,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-04 10:07:26,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:07:26,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:26,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:26,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 10:07:26,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:26,974 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 6 treesize of output 5 [2025-03-04 10:07:26,977 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-04 10:07:27,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:07:27,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 10:07:27,095 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 10:07:27,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 10:07:27,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:07:27,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 10:07:27,158 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:07:27,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:07:27,361 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 20 proven. 31 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:27,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:28,344 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:28,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46453944] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:28,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:28,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 14] total 36 [2025-03-04 10:07:28,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907139781] [2025-03-04 10:07:28,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:28,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-04 10:07:28,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:28,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-04 10:07:28,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1210, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 10:07:29,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 60 [2025-03-04 10:07:29,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 94 transitions, 738 flow. Second operand has 38 states, 38 states have (on average 19.44736842105263) internal successors, (739), 38 states have internal predecessors, (739), 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-04 10:07:29,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:29,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 60 [2025-03-04 10:07:29,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:35,897 INFO L124 PetriNetUnfolderBase]: 35878/53076 cut-off events. [2025-03-04 10:07:35,897 INFO L125 PetriNetUnfolderBase]: For 228699/232935 co-relation queries the response was YES. [2025-03-04 10:07:36,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211214 conditions, 53076 events. 35878/53076 cut-off events. For 228699/232935 co-relation queries the response was YES. Maximal size of possible extension queue 1254. Compared 383781 event pairs, 702 based on Foata normal form. 1044/50927 useless extension candidates. Maximal degree in co-relation 210972. Up to 8285 conditions per place. [2025-03-04 10:07:36,473 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 259 selfloop transitions, 25 changer transitions 0/295 dead transitions. [2025-03-04 10:07:36,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 295 transitions, 2786 flow [2025-03-04 10:07:36,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 10:07:36,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 10:07:36,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 522 transitions. [2025-03-04 10:07:36,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.435 [2025-03-04 10:07:36,474 INFO L175 Difference]: Start difference. First operand has 146 places, 94 transitions, 738 flow. Second operand 20 states and 522 transitions. [2025-03-04 10:07:36,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 295 transitions, 2786 flow [2025-03-04 10:07:36,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 295 transitions, 2650 flow, removed 0 selfloop flow, removed 15 redundant places. [2025-03-04 10:07:36,848 INFO L231 Difference]: Finished difference. Result has 150 places, 95 transitions, 736 flow [2025-03-04 10:07:36,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=736, PETRI_PLACES=150, PETRI_TRANSITIONS=95} [2025-03-04 10:07:36,848 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 90 predicate places. [2025-03-04 10:07:36,848 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 95 transitions, 736 flow [2025-03-04 10:07:36,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 19.44736842105263) internal successors, (739), 38 states have internal predecessors, (739), 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-04 10:07:36,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:36,849 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:36,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:37,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:37,050 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:07:37,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:37,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1699715364, now seen corresponding path program 1 times [2025-03-04 10:07:37,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:37,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899994026] [2025-03-04 10:07:37,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:37,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:37,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:07:37,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:07:37,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:37,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:37,164 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-04 10:07:37,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:37,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899994026] [2025-03-04 10:07:37,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899994026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:37,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:37,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:07:37,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010568247] [2025-03-04 10:07:37,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:37,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:37,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:37,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:37,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:07:37,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 60 [2025-03-04 10:07:37,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 95 transitions, 736 flow. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-04 10:07:37,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:37,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 60 [2025-03-04 10:07:37,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:40,014 INFO L124 PetriNetUnfolderBase]: 14188/26759 cut-off events. [2025-03-04 10:07:40,014 INFO L125 PetriNetUnfolderBase]: For 111133/114796 co-relation queries the response was YES. [2025-03-04 10:07:40,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98438 conditions, 26759 events. 14188/26759 cut-off events. For 111133/114796 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 236837 event pairs, 10966 based on Foata normal form. 36/26231 useless extension candidates. Maximal degree in co-relation 98199. Up to 17850 conditions per place. [2025-03-04 10:07:40,190 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 94 selfloop transitions, 2 changer transitions 1/116 dead transitions. [2025-03-04 10:07:40,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 116 transitions, 1106 flow [2025-03-04 10:07:40,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:07:40,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:07:40,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2025-03-04 10:07:40,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2025-03-04 10:07:40,191 INFO L175 Difference]: Start difference. First operand has 150 places, 95 transitions, 736 flow. Second operand 3 states and 129 transitions. [2025-03-04 10:07:40,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 116 transitions, 1106 flow [2025-03-04 10:07:40,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 116 transitions, 1054 flow, removed 0 selfloop flow, removed 16 redundant places. [2025-03-04 10:07:40,403 INFO L231 Difference]: Finished difference. Result has 137 places, 95 transitions, 701 flow [2025-03-04 10:07:40,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=137, PETRI_TRANSITIONS=95} [2025-03-04 10:07:40,403 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 77 predicate places. [2025-03-04 10:07:40,403 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 95 transitions, 701 flow [2025-03-04 10:07:40,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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-04 10:07:40,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:40,404 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:40,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 10:07:40,404 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:07:40,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:40,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1553886972, now seen corresponding path program 2 times [2025-03-04 10:07:40,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:40,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627480167] [2025-03-04 10:07:40,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:40,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:40,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 10:07:40,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 51 statements. [2025-03-04 10:07:40,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:07:40,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:40,520 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-04 10:07:40,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:40,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627480167] [2025-03-04 10:07:40,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627480167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:40,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324520816] [2025-03-04 10:07:40,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:40,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:40,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:40,522 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:40,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:07:40,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 10:07:40,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 51 statements. [2025-03-04 10:07:40,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:07:40,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:40,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 10:07:40,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:40,635 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 6 treesize of output 5 [2025-03-04 10:07:40,638 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 6 treesize of output 5 [2025-03-04 10:07:40,691 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 10:07:40,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 10:07:40,706 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 10:07:40,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 10:07:40,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:07:40,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:07:40,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2025-03-04 10:07:40,821 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-04 10:07:40,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-04 10:07:41,137 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-04 10:07:41,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-04 10:07:41,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324520816] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:41,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:41,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-03-04 10:07:41,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821026063] [2025-03-04 10:07:41,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:41,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:07:41,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:41,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:07:41,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:07:42,654 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-04 10:07:42,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 95 transitions, 701 flow. Second operand has 14 states, 14 states have (on average 24.642857142857142) internal successors, (345), 14 states have internal predecessors, (345), 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-04 10:07:42,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:42,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-04 10:07:42,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:46,712 INFO L124 PetriNetUnfolderBase]: 24976/37063 cut-off events. [2025-03-04 10:07:46,712 INFO L125 PetriNetUnfolderBase]: For 142857/145925 co-relation queries the response was YES. [2025-03-04 10:07:46,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145656 conditions, 37063 events. 24976/37063 cut-off events. For 142857/145925 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 262087 event pairs, 10850 based on Foata normal form. 732/37159 useless extension candidates. Maximal degree in co-relation 145432. Up to 17562 conditions per place. [2025-03-04 10:07:47,016 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 113 selfloop transitions, 16 changer transitions 0/142 dead transitions. [2025-03-04 10:07:47,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 142 transitions, 1316 flow [2025-03-04 10:07:47,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:07:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:07:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 229 transitions. [2025-03-04 10:07:47,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47708333333333336 [2025-03-04 10:07:47,017 INFO L175 Difference]: Start difference. First operand has 137 places, 95 transitions, 701 flow. Second operand 8 states and 229 transitions. [2025-03-04 10:07:47,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 142 transitions, 1316 flow [2025-03-04 10:07:47,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 142 transitions, 1288 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-04 10:07:47,176 INFO L231 Difference]: Finished difference. Result has 138 places, 95 transitions, 719 flow [2025-03-04 10:07:47,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=719, PETRI_PLACES=138, PETRI_TRANSITIONS=95} [2025-03-04 10:07:47,177 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 78 predicate places. [2025-03-04 10:07:47,177 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 95 transitions, 719 flow [2025-03-04 10:07:47,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 24.642857142857142) internal successors, (345), 14 states have internal predecessors, (345), 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-04 10:07:47,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:47,177 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:47,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 10:07:47,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:47,378 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:07:47,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:47,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1663609355, now seen corresponding path program 2 times [2025-03-04 10:07:47,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:47,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308431626] [2025-03-04 10:07:47,379 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:47,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:47,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-04 10:07:47,407 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 10:07:47,407 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:47,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:47,671 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-04 10:07:47,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:47,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308431626] [2025-03-04 10:07:47,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308431626] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:47,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84676191] [2025-03-04 10:07:47,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:47,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:47,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:47,674 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:47,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:07:47,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-04 10:07:47,813 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 10:07:47,813 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:47,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:47,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-04 10:07:47,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:47,829 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 6 treesize of output 5 [2025-03-04 10:07:47,912 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 10:07:47,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 10:07:48,302 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:48,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:48,767 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:48,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84676191] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:48,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:48,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 13] total 34 [2025-03-04 10:07:48,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528919026] [2025-03-04 10:07:48,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:48,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 10:07:48,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:48,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 10:07:48,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 10:07:49,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 60 [2025-03-04 10:07:49,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 95 transitions, 719 flow. Second operand has 35 states, 35 states have (on average 22.685714285714287) internal successors, (794), 35 states have internal predecessors, (794), 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-04 10:07:49,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:49,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 60 [2025-03-04 10:07:49,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:54,934 INFO L124 PetriNetUnfolderBase]: 26824/39644 cut-off events. [2025-03-04 10:07:54,934 INFO L125 PetriNetUnfolderBase]: For 176024/181023 co-relation queries the response was YES. [2025-03-04 10:07:55,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148665 conditions, 39644 events. 26824/39644 cut-off events. For 176024/181023 co-relation queries the response was YES. Maximal size of possible extension queue 1040. Compared 274501 event pairs, 576 based on Foata normal form. 884/37516 useless extension candidates. Maximal degree in co-relation 148440. Up to 6202 conditions per place. [2025-03-04 10:07:55,201 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 220 selfloop transitions, 28 changer transitions 0/262 dead transitions. [2025-03-04 10:07:55,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 262 transitions, 2453 flow [2025-03-04 10:07:55,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:07:55,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 10:07:55,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 608 transitions. [2025-03-04 10:07:55,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46060606060606063 [2025-03-04 10:07:55,202 INFO L175 Difference]: Start difference. First operand has 138 places, 95 transitions, 719 flow. Second operand 22 states and 608 transitions. [2025-03-04 10:07:55,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 262 transitions, 2453 flow [2025-03-04 10:07:55,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 262 transitions, 2303 flow, removed 1 selfloop flow, removed 10 redundant places. [2025-03-04 10:07:55,428 INFO L231 Difference]: Finished difference. Result has 149 places, 95 transitions, 724 flow [2025-03-04 10:07:55,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=724, PETRI_PLACES=149, PETRI_TRANSITIONS=95} [2025-03-04 10:07:55,428 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 89 predicate places. [2025-03-04 10:07:55,428 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 95 transitions, 724 flow [2025-03-04 10:07:55,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 22.685714285714287) internal successors, (794), 35 states have internal predecessors, (794), 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-04 10:07:55,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:55,429 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:55,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 10:07:55,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:55,629 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:07:55,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:55,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1947442643, now seen corresponding path program 1 times [2025-03-04 10:07:55,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:55,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025031283] [2025-03-04 10:07:55,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:55,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:55,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 10:07:55,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 10:07:55,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:55,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-04 10:07:55,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:55,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025031283] [2025-03-04 10:07:55,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025031283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:55,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:55,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:07:55,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171715896] [2025-03-04 10:07:55,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:55,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:55,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:55,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:55,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:07:55,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 60 [2025-03-04 10:07:55,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 95 transitions, 724 flow. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-04 10:07:55,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:55,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 60 [2025-03-04 10:07:55,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:58,413 INFO L124 PetriNetUnfolderBase]: 14147/23080 cut-off events. [2025-03-04 10:07:58,413 INFO L125 PetriNetUnfolderBase]: For 101753/103954 co-relation queries the response was YES. [2025-03-04 10:07:58,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82872 conditions, 23080 events. 14147/23080 cut-off events. For 101753/103954 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 177245 event pairs, 10850 based on Foata normal form. 41/21576 useless extension candidates. Maximal degree in co-relation 82635. Up to 17605 conditions per place. [2025-03-04 10:07:58,592 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 119 selfloop transitions, 3 changer transitions 0/141 dead transitions. [2025-03-04 10:07:58,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 141 transitions, 1314 flow [2025-03-04 10:07:58,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:07:58,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:07:58,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2025-03-04 10:07:58,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7208333333333333 [2025-03-04 10:07:58,593 INFO L175 Difference]: Start difference. First operand has 149 places, 95 transitions, 724 flow. Second operand 4 states and 173 transitions. [2025-03-04 10:07:58,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 141 transitions, 1314 flow [2025-03-04 10:07:58,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 141 transitions, 1237 flow, removed 3 selfloop flow, removed 18 redundant places. [2025-03-04 10:07:58,674 INFO L231 Difference]: Finished difference. Result has 136 places, 96 transitions, 690 flow [2025-03-04 10:07:58,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=690, PETRI_PLACES=136, PETRI_TRANSITIONS=96} [2025-03-04 10:07:58,675 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 76 predicate places. [2025-03-04 10:07:58,675 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 96 transitions, 690 flow [2025-03-04 10:07:58,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-04 10:07:58,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:58,675 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:58,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 10:07:58,675 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:07:58,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:58,675 INFO L85 PathProgramCache]: Analyzing trace with hash -604108263, now seen corresponding path program 2 times [2025-03-04 10:07:58,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:58,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374420514] [2025-03-04 10:07:58,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:58,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:58,687 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-04 10:07:58,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 54 statements. [2025-03-04 10:07:58,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:07:58,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-04 10:07:58,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:58,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374420514] [2025-03-04 10:07:58,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374420514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:58,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:58,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:07:58,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933132718] [2025-03-04 10:07:58,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:58,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:58,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:58,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:58,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:07:58,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 60 [2025-03-04 10:07:58,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 96 transitions, 690 flow. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-04 10:07:58,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:58,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 60 [2025-03-04 10:07:58,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:02,079 INFO L124 PetriNetUnfolderBase]: 14975/28285 cut-off events. [2025-03-04 10:08:02,079 INFO L125 PetriNetUnfolderBase]: For 98384/101510 co-relation queries the response was YES. [2025-03-04 10:08:02,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101388 conditions, 28285 events. 14975/28285 cut-off events. For 98384/101510 co-relation queries the response was YES. Maximal size of possible extension queue 809. Compared 256625 event pairs, 1077 based on Foata normal form. 336/28194 useless extension candidates. Maximal degree in co-relation 101165. Up to 19715 conditions per place. [2025-03-04 10:08:02,343 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 112 selfloop transitions, 5 changer transitions 0/136 dead transitions. [2025-03-04 10:08:02,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 136 transitions, 1242 flow [2025-03-04 10:08:02,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:08:02,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:08:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2025-03-04 10:08:02,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-03-04 10:08:02,344 INFO L175 Difference]: Start difference. First operand has 136 places, 96 transitions, 690 flow. Second operand 4 states and 165 transitions. [2025-03-04 10:08:02,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 136 transitions, 1242 flow [2025-03-04 10:08:02,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 136 transitions, 1232 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:08:02,523 INFO L231 Difference]: Finished difference. Result has 139 places, 98 transitions, 726 flow [2025-03-04 10:08:02,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=726, PETRI_PLACES=139, PETRI_TRANSITIONS=98} [2025-03-04 10:08:02,523 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 79 predicate places. [2025-03-04 10:08:02,523 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 98 transitions, 726 flow [2025-03-04 10:08:02,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-04 10:08:02,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:02,524 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:02,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 10:08:02,524 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:08:02,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:02,524 INFO L85 PathProgramCache]: Analyzing trace with hash -917916847, now seen corresponding path program 3 times [2025-03-04 10:08:02,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:02,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733483572] [2025-03-04 10:08:02,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:08:02,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:02,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 6 equivalence classes. [2025-03-04 10:08:02,539 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 54 statements. [2025-03-04 10:08:02,539 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:08:02,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-04 10:08:02,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:02,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733483572] [2025-03-04 10:08:02,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733483572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:02,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:02,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:08:02,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671626688] [2025-03-04 10:08:02,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:02,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:08:02,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:02,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:08:02,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:08:02,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-03-04 10:08:02,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 98 transitions, 726 flow. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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-04 10:08:02,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:02,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-03-04 10:08:02,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand