./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:24:02,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:24:02,597 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:24:02,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:24:02,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:24:02,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:24:02,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:24:02,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:24:02,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:24:02,621 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:24:02,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:24:02,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:24:02,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:24:02,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:24:02,622 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:24:02,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:24:02,622 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:24:02,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:24:02,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:24:02,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:24:02,622 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:24:02,622 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:24:02,622 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:24:02,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:24:02,622 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:24:02,622 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:24:02,623 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:24:02,623 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:24:02,623 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:24:02,623 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:24:02,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:24:02,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:24:02,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:24:02,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:24:02,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:24:02,623 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:24:02,623 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:24:02,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:24:02,623 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:24:02,623 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:24:02,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:24:02,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:24:02,623 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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2025-03-09 01:24:02,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:24:02,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:24:02,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:24:02,887 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:24:02,887 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:24:02,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-03-09 01:24:04,052 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd6c77269/0e07163f66dc4adeba8c5261e596416d/FLAGca3e30e84 [2025-03-09 01:24:04,321 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:24:04,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2025-03-09 01:24:04,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd6c77269/0e07163f66dc4adeba8c5261e596416d/FLAGca3e30e84 [2025-03-09 01:24:04,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd6c77269/0e07163f66dc4adeba8c5261e596416d [2025-03-09 01:24:04,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:24:04,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:24:04,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:24:04,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:24:04,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:24:04,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:24:04" (1/1) ... [2025-03-09 01:24:04,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fa2d40b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:04, skipping insertion in model container [2025-03-09 01:24:04,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:24:04" (1/1) ... [2025-03-09 01:24:04,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:24:04,756 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 01:24:04,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:24:04,767 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:24:04,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:24:04,805 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:24:04,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:04 WrapperNode [2025-03-09 01:24:04,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:24:04,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:24:04,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:24:04,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:24:04,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:04" (1/1) ... [2025-03-09 01:24:04,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:04" (1/1) ... [2025-03-09 01:24:04,849 INFO L138 Inliner]: procedures = 25, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 249 [2025-03-09 01:24:04,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:24:04,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:24:04,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:24:04,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:24:04,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:04" (1/1) ... [2025-03-09 01:24:04,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:04" (1/1) ... [2025-03-09 01:24:04,863 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:04" (1/1) ... [2025-03-09 01:24:04,876 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 4 writes are split as follows [0, 4]. [2025-03-09 01:24:04,876 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:04" (1/1) ... [2025-03-09 01:24:04,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:04" (1/1) ... [2025-03-09 01:24:04,891 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:04" (1/1) ... [2025-03-09 01:24:04,892 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:04" (1/1) ... [2025-03-09 01:24:04,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:04" (1/1) ... [2025-03-09 01:24:04,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:04" (1/1) ... [2025-03-09 01:24:04,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:24:04,901 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:24:04,901 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:24:04,901 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:24:04,902 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:04" (1/1) ... [2025-03-09 01:24:04,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:24:04,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:04,933 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:24:04,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:24:04,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:24:04,953 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:24:04,953 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:24:04,954 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:24:04,954 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:24:04,954 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:24:04,954 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:24:04,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:24:04,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:24:04,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:24:04,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:24:04,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:24:04,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:24:04,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:24:04,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:24:04,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:24:04,956 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:24:05,043 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:24:05,045 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:24:05,421 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:24:05,422 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:24:05,695 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:24:05,695 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:24:05,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:24:05 BoogieIcfgContainer [2025-03-09 01:24:05,696 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:24:05,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:24:05,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:24:05,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:24:05,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:24:04" (1/3) ... [2025-03-09 01:24:05,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a568b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:24:05, skipping insertion in model container [2025-03-09 01:24:05,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:24:04" (2/3) ... [2025-03-09 01:24:05,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a568b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:24:05, skipping insertion in model container [2025-03-09 01:24:05,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:24:05" (3/3) ... [2025-03-09 01:24:05,703 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2025-03-09 01:24:05,715 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:24:05,717 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 55 locations, 1 initial locations, 6 loop locations, and 20 error locations. [2025-03-09 01:24:05,717 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:24:05,765 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 01:24:05,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 60 transitions, 141 flow [2025-03-09 01:24:05,818 INFO L124 PetriNetUnfolderBase]: 6/57 cut-off events. [2025-03-09 01:24:05,820 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:24:05,824 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 6. Compared 106 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-03-09 01:24:05,825 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 60 transitions, 141 flow [2025-03-09 01:24:05,828 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 56 transitions, 130 flow [2025-03-09 01:24:05,835 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:24:05,847 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;@219d3ba3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:24:05,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-03-09 01:24:05,852 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:24:05,852 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:24:05,852 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:24:05,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:05,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:24:05,853 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:24:05,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:05,857 INFO L85 PathProgramCache]: Analyzing trace with hash 777469, now seen corresponding path program 1 times [2025-03-09 01:24:05,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:05,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296917318] [2025-03-09 01:24:05,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:05,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:05,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:24:05,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:24:05,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:05,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:06,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:06,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296917318] [2025-03-09 01:24:06,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296917318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:06,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:06,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:24:06,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570575269] [2025-03-09 01:24:06,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:06,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:24:06,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:06,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:24:06,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:24:06,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-09 01:24:06,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:06,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:06,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-09 01:24:06,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:06,271 INFO L124 PetriNetUnfolderBase]: 306/588 cut-off events. [2025-03-09 01:24:06,271 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-09 01:24:06,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 588 events. 306/588 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2574 event pairs, 202 based on Foata normal form. 1/506 useless extension candidates. Maximal degree in co-relation 915. Up to 441 conditions per place. [2025-03-09 01:24:06,282 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 29 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2025-03-09 01:24:06,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 182 flow [2025-03-09 01:24:06,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:24:06,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:24:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-03-09 01:24:06,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5944444444444444 [2025-03-09 01:24:06,295 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 130 flow. Second operand 3 states and 107 transitions. [2025-03-09 01:24:06,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 182 flow [2025-03-09 01:24:06,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 170 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:24:06,301 INFO L231 Difference]: Finished difference. Result has 51 places, 51 transitions, 112 flow [2025-03-09 01:24:06,303 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-09 01:24:06,306 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2025-03-09 01:24:06,308 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 51 transitions, 112 flow [2025-03-09 01:24:06,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:06,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:06,308 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:24:06,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:24:06,309 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:24:06,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:06,309 INFO L85 PathProgramCache]: Analyzing trace with hash 777470, now seen corresponding path program 1 times [2025-03-09 01:24:06,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:06,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980246326] [2025-03-09 01:24:06,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:06,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:06,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:24:06,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:24:06,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:06,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:06,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:06,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:06,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980246326] [2025-03-09 01:24:06,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980246326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:06,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:06,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:24:06,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313558072] [2025-03-09 01:24:06,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:06,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:24:06,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:06,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:24:06,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:24:06,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-09 01:24:06,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 51 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:06,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:06,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-09 01:24:06,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:06,770 INFO L124 PetriNetUnfolderBase]: 307/591 cut-off events. [2025-03-09 01:24:06,771 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 01:24:06,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 591 events. 307/591 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2584 event pairs, 202 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 1027. Up to 454 conditions per place. [2025-03-09 01:24:06,777 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 33 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2025-03-09 01:24:06,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 192 flow [2025-03-09 01:24:06,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:24:06,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:24:06,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-03-09 01:24:06,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5583333333333333 [2025-03-09 01:24:06,779 INFO L175 Difference]: Start difference. First operand has 51 places, 51 transitions, 112 flow. Second operand 4 states and 134 transitions. [2025-03-09 01:24:06,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 192 flow [2025-03-09 01:24:06,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 54 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:24:06,781 INFO L231 Difference]: Finished difference. Result has 54 places, 54 transitions, 135 flow [2025-03-09 01:24:06,781 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=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=54, PETRI_TRANSITIONS=54} [2025-03-09 01:24:06,781 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2025-03-09 01:24:06,782 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 54 transitions, 135 flow [2025-03-09 01:24:06,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:06,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:06,782 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:24:06,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:24:06,783 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:24:06,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:06,786 INFO L85 PathProgramCache]: Analyzing trace with hash 24103410, now seen corresponding path program 1 times [2025-03-09 01:24:06,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:06,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162271914] [2025-03-09 01:24:06,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:06,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:06,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:24:06,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:24:06,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:06,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:06,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:06,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162271914] [2025-03-09 01:24:06,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162271914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:06,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:06,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:24:06,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884110091] [2025-03-09 01:24:06,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:06,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:24:06,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:06,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:24:06,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:24:06,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-03-09 01:24:06,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 54 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:06,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:06,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-03-09 01:24:06,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:07,030 INFO L124 PetriNetUnfolderBase]: 309/601 cut-off events. [2025-03-09 01:24:07,030 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 01:24:07,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1090 conditions, 601 events. 309/601 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2646 event pairs, 202 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 1038. Up to 452 conditions per place. [2025-03-09 01:24:07,033 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 32 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2025-03-09 01:24:07,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 235 flow [2025-03-09 01:24:07,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:24:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:24:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2025-03-09 01:24:07,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-03-09 01:24:07,034 INFO L175 Difference]: Start difference. First operand has 54 places, 54 transitions, 135 flow. Second operand 4 states and 152 transitions. [2025-03-09 01:24:07,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 235 flow [2025-03-09 01:24:07,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:24:07,036 INFO L231 Difference]: Finished difference. Result has 58 places, 60 transitions, 188 flow [2025-03-09 01:24:07,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=58, PETRI_TRANSITIONS=60} [2025-03-09 01:24:07,036 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -2 predicate places. [2025-03-09 01:24:07,036 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 60 transitions, 188 flow [2025-03-09 01:24:07,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:07,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:07,037 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:24:07,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:24:07,037 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:24:07,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:07,037 INFO L85 PathProgramCache]: Analyzing trace with hash 747173677, now seen corresponding path program 1 times [2025-03-09 01:24:07,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:07,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775959050] [2025-03-09 01:24:07,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:07,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:07,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:24:07,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:24:07,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:07,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:07,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:07,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775959050] [2025-03-09 01:24:07,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775959050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:24:07,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147268606] [2025-03-09 01:24:07,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:07,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:07,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:07,242 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:24:07,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:24:07,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:24:07,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:24:07,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:07,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:07,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:24:07,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:07,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:24:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:07,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:24:07,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:07,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147268606] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:24:07,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:24:07,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:24:07,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369688106] [2025-03-09 01:24:07,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:24:07,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:24:07,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:07,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:24:07,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:24:07,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-09 01:24:07,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 60 transitions, 188 flow. Second operand has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:07,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:07,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-09 01:24:07,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:08,016 INFO L124 PetriNetUnfolderBase]: 310/603 cut-off events. [2025-03-09 01:24:08,016 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-09 01:24:08,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1127 conditions, 603 events. 310/603 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2653 event pairs, 202 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 1043. Up to 461 conditions per place. [2025-03-09 01:24:08,021 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 35 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2025-03-09 01:24:08,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 62 transitions, 289 flow [2025-03-09 01:24:08,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:24:08,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:24:08,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 233 transitions. [2025-03-09 01:24:08,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48541666666666666 [2025-03-09 01:24:08,024 INFO L175 Difference]: Start difference. First operand has 58 places, 60 transitions, 188 flow. Second operand 8 states and 233 transitions. [2025-03-09 01:24:08,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 62 transitions, 289 flow [2025-03-09 01:24:08,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 289 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:24:08,027 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 219 flow [2025-03-09 01:24:08,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=219, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2025-03-09 01:24:08,028 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2025-03-09 01:24:08,029 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 219 flow [2025-03-09 01:24:08,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:08,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:08,029 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:24:08,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:24:08,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:08,230 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:24:08,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:08,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1687549347, now seen corresponding path program 1 times [2025-03-09 01:24:08,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:08,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630336286] [2025-03-09 01:24:08,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:08,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:08,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:24:08,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:24:08,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:08,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:08,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:08,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:08,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630336286] [2025-03-09 01:24:08,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630336286] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:24:08,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442345903] [2025-03-09 01:24:08,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:08,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:08,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:08,478 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:24:08,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:24:08,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:24:08,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:24:08,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:08,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:08,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 01:24:08,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:08,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:24:08,650 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 01:24:08,650 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 32 treesize of output 27 [2025-03-09 01:24:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:08,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:24:08,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:08,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442345903] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:24:08,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:24:08,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 10 [2025-03-09 01:24:08,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488595986] [2025-03-09 01:24:08,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:08,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:24:08,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:08,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:24:08,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:24:08,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-09 01:24:08,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:08,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:08,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-09 01:24:08,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:09,031 INFO L124 PetriNetUnfolderBase]: 612/1177 cut-off events. [2025-03-09 01:24:09,032 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-09 01:24:09,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2165 conditions, 1177 events. 612/1177 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6200 event pairs, 404 based on Foata normal form. 2/1026 useless extension candidates. Maximal degree in co-relation 1084. Up to 455 conditions per place. [2025-03-09 01:24:09,037 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 59 selfloop transitions, 10 changer transitions 0/86 dead transitions. [2025-03-09 01:24:09,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 86 transitions, 418 flow [2025-03-09 01:24:09,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:24:09,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:24:09,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2025-03-09 01:24:09,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6233333333333333 [2025-03-09 01:24:09,038 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 219 flow. Second operand 5 states and 187 transitions. [2025-03-09 01:24:09,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 86 transitions, 418 flow [2025-03-09 01:24:09,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 86 transitions, 376 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-09 01:24:09,041 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 213 flow [2025-03-09 01:24:09,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2025-03-09 01:24:09,041 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 2 predicate places. [2025-03-09 01:24:09,041 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 213 flow [2025-03-09 01:24:09,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:09,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:09,041 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:09,048 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-09 01:24:09,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:09,242 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:24:09,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:09,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1762689866, now seen corresponding path program 1 times [2025-03-09 01:24:09,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:09,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247514181] [2025-03-09 01:24:09,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:09,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:09,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:24:09,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:24:09,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:09,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:09,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:09,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:09,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247514181] [2025-03-09 01:24:09,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247514181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:24:09,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856689587] [2025-03-09 01:24:09,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:09,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:09,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:09,344 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:24:09,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:24:09,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:24:09,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:24:09,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:09,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:09,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:24:09,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:09,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:09,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:24:09,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:09,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856689587] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:24:09,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:24:09,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-09 01:24:09,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515980379] [2025-03-09 01:24:09,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:24:09,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:24:09,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:09,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:24:09,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:24:09,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-03-09 01:24:09,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 213 flow. Second operand has 13 states, 13 states have (on average 28.53846153846154) internal successors, (371), 13 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:09,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:09,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-03-09 01:24:09,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:09,913 INFO L124 PetriNetUnfolderBase]: 918/1768 cut-off events. [2025-03-09 01:24:09,914 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-09 01:24:09,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3242 conditions, 1768 events. 918/1768 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 9018 event pairs, 606 based on Foata normal form. 2/1537 useless extension candidates. Maximal degree in co-relation 1058. Up to 884 conditions per place. [2025-03-09 01:24:09,925 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 52 selfloop transitions, 29 changer transitions 0/100 dead transitions. [2025-03-09 01:24:09,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 100 transitions, 509 flow [2025-03-09 01:24:09,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:24:09,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:24:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 325 transitions. [2025-03-09 01:24:09,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6018518518518519 [2025-03-09 01:24:09,926 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 213 flow. Second operand 9 states and 325 transitions. [2025-03-09 01:24:09,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 100 transitions, 509 flow [2025-03-09 01:24:09,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 100 transitions, 507 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:24:09,929 INFO L231 Difference]: Finished difference. Result has 71 places, 75 transitions, 365 flow [2025-03-09 01:24:09,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=365, PETRI_PLACES=71, PETRI_TRANSITIONS=75} [2025-03-09 01:24:09,929 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 11 predicate places. [2025-03-09 01:24:09,929 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 75 transitions, 365 flow [2025-03-09 01:24:09,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 28.53846153846154) internal successors, (371), 13 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:09,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:09,930 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:09,937 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-09 01:24:10,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:10,130 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:24:10,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:10,131 INFO L85 PathProgramCache]: Analyzing trace with hash -754160616, now seen corresponding path program 1 times [2025-03-09 01:24:10,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:10,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279784863] [2025-03-09 01:24:10,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:10,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:10,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:24:10,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:24:10,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:10,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:10,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:10,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:10,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279784863] [2025-03-09 01:24:10,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279784863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:10,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:10,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:24:10,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9971699] [2025-03-09 01:24:10,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:10,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:24:10,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:10,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:24:10,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:24:10,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-09 01:24:10,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 75 transitions, 365 flow. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:10,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:10,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-09 01:24:10,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:10,478 INFO L124 PetriNetUnfolderBase]: 1322/2517 cut-off events. [2025-03-09 01:24:10,478 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-09 01:24:10,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4679 conditions, 2517 events. 1322/2517 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 14155 event pairs, 808 based on Foata normal form. 0/2133 useless extension candidates. Maximal degree in co-relation 1879. Up to 1153 conditions per place. [2025-03-09 01:24:10,491 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 72 selfloop transitions, 20 changer transitions 0/110 dead transitions. [2025-03-09 01:24:10,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 110 transitions, 639 flow [2025-03-09 01:24:10,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:24:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:24:10,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 233 transitions. [2025-03-09 01:24:10,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6472222222222223 [2025-03-09 01:24:10,492 INFO L175 Difference]: Start difference. First operand has 71 places, 75 transitions, 365 flow. Second operand 6 states and 233 transitions. [2025-03-09 01:24:10,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 110 transitions, 639 flow [2025-03-09 01:24:10,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 110 transitions, 569 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-03-09 01:24:10,499 INFO L231 Difference]: Finished difference. Result has 74 places, 77 transitions, 353 flow [2025-03-09 01:24:10,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=353, PETRI_PLACES=74, PETRI_TRANSITIONS=77} [2025-03-09 01:24:10,499 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 14 predicate places. [2025-03-09 01:24:10,499 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 77 transitions, 353 flow [2025-03-09 01:24:10,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:10,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:10,500 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:10,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:24:10,500 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:24:10,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:10,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1099182623, now seen corresponding path program 1 times [2025-03-09 01:24:10,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:10,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633347208] [2025-03-09 01:24:10,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:10,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:10,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:24:10,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:24:10,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:10,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:10,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:10,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633347208] [2025-03-09 01:24:10,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633347208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:10,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:10,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:24:10,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139434567] [2025-03-09 01:24:10,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:10,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:24:10,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:10,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:24:10,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:24:10,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-09 01:24:10,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 77 transitions, 353 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 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-09 01:24:10,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:10,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-09 01:24:10,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:10,869 INFO L124 PetriNetUnfolderBase]: 1256/2463 cut-off events. [2025-03-09 01:24:10,869 INFO L125 PetriNetUnfolderBase]: For 718/814 co-relation queries the response was YES. [2025-03-09 01:24:10,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5051 conditions, 2463 events. 1256/2463 cut-off events. For 718/814 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 14307 event pairs, 778 based on Foata normal form. 0/2062 useless extension candidates. Maximal degree in co-relation 2052. Up to 1175 conditions per place. [2025-03-09 01:24:10,881 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 69 selfloop transitions, 20 changer transitions 0/107 dead transitions. [2025-03-09 01:24:10,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 107 transitions, 619 flow [2025-03-09 01:24:10,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:24:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:24:10,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 230 transitions. [2025-03-09 01:24:10,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-03-09 01:24:10,882 INFO L175 Difference]: Start difference. First operand has 74 places, 77 transitions, 353 flow. Second operand 6 states and 230 transitions. [2025-03-09 01:24:10,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 107 transitions, 619 flow [2025-03-09 01:24:10,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 107 transitions, 587 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:24:10,885 INFO L231 Difference]: Finished difference. Result has 78 places, 79 transitions, 379 flow [2025-03-09 01:24:10,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=379, PETRI_PLACES=78, PETRI_TRANSITIONS=79} [2025-03-09 01:24:10,886 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 18 predicate places. [2025-03-09 01:24:10,886 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 79 transitions, 379 flow [2025-03-09 01:24:10,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 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-09 01:24:10,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:10,886 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-03-09 01:24:10,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:24:10,886 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:24:10,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:10,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1590061031, now seen corresponding path program 2 times [2025-03-09 01:24:10,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:10,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378251373] [2025-03-09 01:24:10,887 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:24:10,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:10,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-09 01:24:10,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:24:10,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:24:10,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:24:11,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:11,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378251373] [2025-03-09 01:24:11,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378251373] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:24:11,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630401786] [2025-03-09 01:24:11,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:24:11,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:11,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:11,069 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:24:11,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:24:11,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-09 01:24:11,119 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:24:11,119 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:24:11,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:11,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 01:24:11,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:11,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:24:11,241 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 01:24:11,242 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 23 treesize of output 20 [2025-03-09 01:24:11,323 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:24:11,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:24:11,504 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:24:11,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630401786] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:24:11,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:24:11,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-09 01:24:11,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587251393] [2025-03-09 01:24:11,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:24:11,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:24:11,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:11,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:24:11,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:24:12,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-09 01:24:12,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 79 transitions, 379 flow. Second operand has 20 states, 20 states have (on average 25.5) internal successors, (510), 20 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:12,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:12,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-09 01:24:12,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:13,371 INFO L124 PetriNetUnfolderBase]: 1394/2905 cut-off events. [2025-03-09 01:24:13,371 INFO L125 PetriNetUnfolderBase]: For 1403/1527 co-relation queries the response was YES. [2025-03-09 01:24:13,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6681 conditions, 2905 events. 1394/2905 cut-off events. For 1403/1527 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 17205 event pairs, 1010 based on Foata normal form. 16/2561 useless extension candidates. Maximal degree in co-relation 3185. Up to 1623 conditions per place. [2025-03-09 01:24:13,396 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 78 selfloop transitions, 104 changer transitions 0/199 dead transitions. [2025-03-09 01:24:13,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 199 transitions, 1410 flow [2025-03-09 01:24:13,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 01:24:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-09 01:24:13,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 757 transitions. [2025-03-09 01:24:13,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5256944444444445 [2025-03-09 01:24:13,398 INFO L175 Difference]: Start difference. First operand has 78 places, 79 transitions, 379 flow. Second operand 24 states and 757 transitions. [2025-03-09 01:24:13,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 199 transitions, 1410 flow [2025-03-09 01:24:13,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 199 transitions, 1336 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:24:13,408 INFO L231 Difference]: Finished difference. Result has 108 places, 164 transitions, 1191 flow [2025-03-09 01:24:13,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1191, PETRI_PLACES=108, PETRI_TRANSITIONS=164} [2025-03-09 01:24:13,409 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 48 predicate places. [2025-03-09 01:24:13,409 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 164 transitions, 1191 flow [2025-03-09 01:24:13,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 25.5) internal successors, (510), 20 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:13,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:13,409 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:13,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:24:13,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:13,613 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:24:13,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:13,614 INFO L85 PathProgramCache]: Analyzing trace with hash -255916574, now seen corresponding path program 1 times [2025-03-09 01:24:13,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:13,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886087492] [2025-03-09 01:24:13,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:13,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:13,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:24:13,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:24:13,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:13,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:24:13,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:13,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886087492] [2025-03-09 01:24:13,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886087492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:13,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:13,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:24:13,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032220670] [2025-03-09 01:24:13,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:13,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:24:13,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:13,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:24:13,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:24:13,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-09 01:24:13,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 164 transitions, 1191 flow. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:13,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:13,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-09 01:24:13,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:13,991 INFO L124 PetriNetUnfolderBase]: 1350/2681 cut-off events. [2025-03-09 01:24:13,991 INFO L125 PetriNetUnfolderBase]: For 1543/1786 co-relation queries the response was YES. [2025-03-09 01:24:14,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6373 conditions, 2681 events. 1350/2681 cut-off events. For 1543/1786 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 14369 event pairs, 893 based on Foata normal form. 0/2298 useless extension candidates. Maximal degree in co-relation 6050. Up to 1627 conditions per place. [2025-03-09 01:24:14,013 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 125 selfloop transitions, 42 changer transitions 0/185 dead transitions. [2025-03-09 01:24:14,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 185 transitions, 1611 flow [2025-03-09 01:24:14,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:24:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:24:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 223 transitions. [2025-03-09 01:24:14,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6194444444444445 [2025-03-09 01:24:14,015 INFO L175 Difference]: Start difference. First operand has 108 places, 164 transitions, 1191 flow. Second operand 6 states and 223 transitions. [2025-03-09 01:24:14,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 185 transitions, 1611 flow [2025-03-09 01:24:14,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 185 transitions, 1581 flow, removed 15 selfloop flow, removed 0 redundant places. [2025-03-09 01:24:14,026 INFO L231 Difference]: Finished difference. Result has 115 places, 166 transitions, 1265 flow [2025-03-09 01:24:14,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1265, PETRI_PLACES=115, PETRI_TRANSITIONS=166} [2025-03-09 01:24:14,027 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 55 predicate places. [2025-03-09 01:24:14,027 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 166 transitions, 1265 flow [2025-03-09 01:24:14,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:14,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:14,027 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:14,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:24:14,027 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:24:14,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:14,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1568853786, now seen corresponding path program 1 times [2025-03-09 01:24:14,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:14,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123094060] [2025-03-09 01:24:14,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:14,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:14,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:24:14,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:24:14,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:14,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:14,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:24:14,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:14,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123094060] [2025-03-09 01:24:14,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123094060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:14,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:14,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:24:14,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795919427] [2025-03-09 01:24:14,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:14,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:24:14,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:14,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:24:14,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:24:14,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-09 01:24:14,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 166 transitions, 1265 flow. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:14,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:14,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-09 01:24:14,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:14,438 INFO L124 PetriNetUnfolderBase]: 1350/2795 cut-off events. [2025-03-09 01:24:14,439 INFO L125 PetriNetUnfolderBase]: For 1831/2050 co-relation queries the response was YES. [2025-03-09 01:24:14,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6921 conditions, 2795 events. 1350/2795 cut-off events. For 1831/2050 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 15554 event pairs, 971 based on Foata normal form. 0/2554 useless extension candidates. Maximal degree in co-relation 6583. Up to 1992 conditions per place. [2025-03-09 01:24:14,455 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 119 selfloop transitions, 29 changer transitions 0/164 dead transitions. [2025-03-09 01:24:14,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 164 transitions, 1557 flow [2025-03-09 01:24:14,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:24:14,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:24:14,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2025-03-09 01:24:14,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4633333333333333 [2025-03-09 01:24:14,456 INFO L175 Difference]: Start difference. First operand has 115 places, 166 transitions, 1265 flow. Second operand 5 states and 139 transitions. [2025-03-09 01:24:14,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 164 transitions, 1557 flow [2025-03-09 01:24:14,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 164 transitions, 1475 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-09 01:24:14,466 INFO L231 Difference]: Finished difference. Result has 114 places, 164 transitions, 1237 flow [2025-03-09 01:24:14,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1237, PETRI_PLACES=114, PETRI_TRANSITIONS=164} [2025-03-09 01:24:14,466 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 54 predicate places. [2025-03-09 01:24:14,466 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 164 transitions, 1237 flow [2025-03-09 01:24:14,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:14,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:14,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:14,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:24:14,467 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:24:14,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:14,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1568853787, now seen corresponding path program 1 times [2025-03-09 01:24:14,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:14,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099713796] [2025-03-09 01:24:14,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:14,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:14,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:24:14,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:24:14,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:14,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:14,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:24:14,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:14,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099713796] [2025-03-09 01:24:14,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099713796] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:24:14,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291152732] [2025-03-09 01:24:14,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:14,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:14,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:14,745 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:24:14,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:24:14,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:24:14,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:24:14,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:14,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:14,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-09 01:24:14,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:14,816 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-09 01:24:14,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:24:14,854 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:24:14,856 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-09 01:24:14,863 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 18 treesize of output 13 [2025-03-09 01:24:14,958 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2025-03-09 01:24:14,959 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 28 treesize of output 32 [2025-03-09 01:24:15,282 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:24:15,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:24:15,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:24:15,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291152732] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:24:15,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:24:15,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 15 [2025-03-09 01:24:15,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503673737] [2025-03-09 01:24:15,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:15,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:24:15,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:15,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:24:15,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:24:19,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:24:19,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-09 01:24:19,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 164 transitions, 1237 flow. Second operand has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 7 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:19,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:19,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-09 01:24:19,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:23,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:24:32,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:24:36,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:24:40,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:24:44,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:24:44,648 INFO L124 PetriNetUnfolderBase]: 1965/3873 cut-off events. [2025-03-09 01:24:44,649 INFO L125 PetriNetUnfolderBase]: For 2165/2420 co-relation queries the response was YES. [2025-03-09 01:24:44,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9542 conditions, 3873 events. 1965/3873 cut-off events. For 2165/2420 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 23212 event pairs, 1044 based on Foata normal form. 0/3414 useless extension candidates. Maximal degree in co-relation 9216. Up to 1976 conditions per place. [2025-03-09 01:24:44,669 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 142 selfloop transitions, 42 changer transitions 0/200 dead transitions. [2025-03-09 01:24:44,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 200 transitions, 1741 flow [2025-03-09 01:24:44,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:24:44,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:24:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 250 transitions. [2025-03-09 01:24:44,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2025-03-09 01:24:44,671 INFO L175 Difference]: Start difference. First operand has 114 places, 164 transitions, 1237 flow. Second operand 7 states and 250 transitions. [2025-03-09 01:24:44,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 200 transitions, 1741 flow [2025-03-09 01:24:44,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 200 transitions, 1704 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:24:44,682 INFO L231 Difference]: Finished difference. Result has 119 places, 168 transitions, 1341 flow [2025-03-09 01:24:44,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1200, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1341, PETRI_PLACES=119, PETRI_TRANSITIONS=168} [2025-03-09 01:24:44,682 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 59 predicate places. [2025-03-09 01:24:44,682 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 168 transitions, 1341 flow [2025-03-09 01:24:44,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 7 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:44,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:44,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:44,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 01:24:44,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-09 01:24:44,883 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:24:44,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:44,884 INFO L85 PathProgramCache]: Analyzing trace with hash 133029025, now seen corresponding path program 1 times [2025-03-09 01:24:44,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:44,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778456681] [2025-03-09 01:24:44,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:44,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:44,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:24:44,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:24:44,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:44,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:44,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:24:44,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:44,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778456681] [2025-03-09 01:24:44,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778456681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:24:44,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:24:44,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:24:44,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595835197] [2025-03-09 01:24:44,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:24:44,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:24:44,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:44,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:24:44,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:24:44,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-09 01:24:44,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 168 transitions, 1341 flow. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:44,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:24:44,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-09 01:24:44,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:24:45,256 INFO L124 PetriNetUnfolderBase]: 1698/3432 cut-off events. [2025-03-09 01:24:45,256 INFO L125 PetriNetUnfolderBase]: For 5087/5621 co-relation queries the response was YES. [2025-03-09 01:24:45,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9712 conditions, 3432 events. 1698/3432 cut-off events. For 5087/5621 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 20252 event pairs, 1191 based on Foata normal form. 0/3180 useless extension candidates. Maximal degree in co-relation 9374. Up to 2481 conditions per place. [2025-03-09 01:24:45,278 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 111 selfloop transitions, 40 changer transitions 0/166 dead transitions. [2025-03-09 01:24:45,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 166 transitions, 1639 flow [2025-03-09 01:24:45,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:24:45,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:24:45,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2025-03-09 01:24:45,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4766666666666667 [2025-03-09 01:24:45,281 INFO L175 Difference]: Start difference. First operand has 119 places, 168 transitions, 1341 flow. Second operand 5 states and 143 transitions. [2025-03-09 01:24:45,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 166 transitions, 1639 flow [2025-03-09 01:24:45,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 166 transitions, 1636 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:24:45,292 INFO L231 Difference]: Finished difference. Result has 120 places, 166 transitions, 1414 flow [2025-03-09 01:24:45,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1334, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1414, PETRI_PLACES=120, PETRI_TRANSITIONS=166} [2025-03-09 01:24:45,293 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 60 predicate places. [2025-03-09 01:24:45,294 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 166 transitions, 1414 flow [2025-03-09 01:24:45,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:24:45,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:24:45,294 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:24:45,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:24:45,294 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:24:45,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:24:45,295 INFO L85 PathProgramCache]: Analyzing trace with hash 133029026, now seen corresponding path program 1 times [2025-03-09 01:24:45,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:24:45,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818327401] [2025-03-09 01:24:45,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:45,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:24:45,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:24:45,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:24:45,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:45,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:45,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:24:45,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:24:45,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818327401] [2025-03-09 01:24:45,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818327401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:24:45,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050246722] [2025-03-09 01:24:45,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:24:45,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:24:45,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:24:45,494 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:24:45,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:24:45,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:24:45,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:24:45,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:24:45,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:24:45,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:24:45,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:24:45,578 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-09 01:24:45,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:24:45,618 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-09 01:24:45,626 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:24:45,626 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-09 01:24:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:24:45,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:24:45,753 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 52 treesize of output 48 [2025-03-09 01:24:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:24:45,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050246722] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:24:45,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:24:45,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-09 01:24:45,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773649190] [2025-03-09 01:24:45,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:24:45,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:24:45,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:24:45,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:24:45,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:24:49,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:24:53,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:24:57,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:25:01,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:25:05,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:25:10,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:25:14,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:25:18,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:25:18,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2025-03-09 01:25:18,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 166 transitions, 1414 flow. Second operand has 13 states, 13 states have (on average 20.53846153846154) internal successors, (267), 13 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:25:18,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:18,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2025-03-09 01:25:18,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:18,792 INFO L124 PetriNetUnfolderBase]: 3465/5841 cut-off events. [2025-03-09 01:25:18,793 INFO L125 PetriNetUnfolderBase]: For 9070/10396 co-relation queries the response was YES. [2025-03-09 01:25:18,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16608 conditions, 5841 events. 3465/5841 cut-off events. For 9070/10396 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 32608 event pairs, 1890 based on Foata normal form. 0/5115 useless extension candidates. Maximal degree in co-relation 16254. Up to 3562 conditions per place. [2025-03-09 01:25:18,821 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 136 selfloop transitions, 56 changer transitions 0/204 dead transitions. [2025-03-09 01:25:18,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 204 transitions, 1962 flow [2025-03-09 01:25:18,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:25:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:25:18,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 221 transitions. [2025-03-09 01:25:18,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46041666666666664 [2025-03-09 01:25:18,823 INFO L175 Difference]: Start difference. First operand has 120 places, 166 transitions, 1414 flow. Second operand 8 states and 221 transitions. [2025-03-09 01:25:18,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 204 transitions, 1962 flow [2025-03-09 01:25:18,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 204 transitions, 1903 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:25:18,835 INFO L231 Difference]: Finished difference. Result has 126 places, 170 transitions, 1524 flow [2025-03-09 01:25:18,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1524, PETRI_PLACES=126, PETRI_TRANSITIONS=170} [2025-03-09 01:25:18,836 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 66 predicate places. [2025-03-09 01:25:18,836 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 170 transitions, 1524 flow [2025-03-09 01:25:18,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 20.53846153846154) internal successors, (267), 13 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:25:18,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:18,836 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:25:18,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:25:19,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:25:19,037 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:25:19,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:19,037 INFO L85 PathProgramCache]: Analyzing trace with hash 134994079, now seen corresponding path program 1 times [2025-03-09 01:25:19,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:19,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789986248] [2025-03-09 01:25:19,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:19,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:19,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:25:19,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:25:19,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:19,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:25:19,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:19,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789986248] [2025-03-09 01:25:19,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789986248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:25:19,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396027429] [2025-03-09 01:25:19,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:19,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:25:19,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:25:19,124 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:25:19,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:25:19,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:25:19,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:25:19,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:19,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:19,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:25:19,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:25:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:25:19,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:25:19,272 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:25:19,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396027429] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:25:19,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:25:19,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-09 01:25:19,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34280001] [2025-03-09 01:25:19,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:25:19,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:25:19,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:19,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:25:19,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:25:19,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-09 01:25:19,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 170 transitions, 1524 flow. Second operand has 14 states, 14 states have (on average 28.142857142857142) internal successors, (394), 14 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:25:19,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:19,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-09 01:25:19,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:19,879 INFO L124 PetriNetUnfolderBase]: 2871/5291 cut-off events. [2025-03-09 01:25:19,879 INFO L125 PetriNetUnfolderBase]: For 10055/10897 co-relation queries the response was YES. [2025-03-09 01:25:19,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16362 conditions, 5291 events. 2871/5291 cut-off events. For 10055/10897 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 31118 event pairs, 1561 based on Foata normal form. 50/4959 useless extension candidates. Maximal degree in co-relation 15998. Up to 2457 conditions per place. [2025-03-09 01:25:19,902 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 114 selfloop transitions, 107 changer transitions 0/235 dead transitions. [2025-03-09 01:25:19,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 235 transitions, 2264 flow [2025-03-09 01:25:19,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:25:19,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:25:19,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 368 transitions. [2025-03-09 01:25:19,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2025-03-09 01:25:19,904 INFO L175 Difference]: Start difference. First operand has 126 places, 170 transitions, 1524 flow. Second operand 10 states and 368 transitions. [2025-03-09 01:25:19,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 235 transitions, 2264 flow [2025-03-09 01:25:19,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 235 transitions, 2190 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:25:19,919 INFO L231 Difference]: Finished difference. Result has 134 places, 174 transitions, 1728 flow [2025-03-09 01:25:19,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1728, PETRI_PLACES=134, PETRI_TRANSITIONS=174} [2025-03-09 01:25:19,920 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 74 predicate places. [2025-03-09 01:25:19,920 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 174 transitions, 1728 flow [2025-03-09 01:25:19,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 28.142857142857142) internal successors, (394), 14 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:25:19,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:25:19,920 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:25:19,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 01:25:20,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:25:20,121 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:25:20,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:25:20,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1016588315, now seen corresponding path program 1 times [2025-03-09 01:25:20,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:25:20,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341800438] [2025-03-09 01:25:20,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:20,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:25:20,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:25:20,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:25:20,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:20,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:20,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:25:20,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:25:20,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341800438] [2025-03-09 01:25:20,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341800438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:25:20,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362004107] [2025-03-09 01:25:20,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:25:20,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:25:20,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:25:20,334 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:25:20,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:25:20,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:25:20,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:25:20,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:25:20,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:25:20,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-09 01:25:20,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:25:20,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:25:20,421 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-09 01:25:20,455 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:25:20,455 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-09 01:25:20,460 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 18 treesize of output 13 [2025-03-09 01:25:20,534 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2025-03-09 01:25:20,534 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 28 treesize of output 32 [2025-03-09 01:25:21,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:25:21,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:25:21,285 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:25:21,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362004107] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:25:21,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:25:21,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 16 [2025-03-09 01:25:21,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908658400] [2025-03-09 01:25:21,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:25:21,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:25:21,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:25:21,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:25:21,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:25:21,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 60 [2025-03-09 01:25:21,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 174 transitions, 1728 flow. Second operand has 7 states, 7 states have (on average 27.428571428571427) internal successors, (192), 7 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:25:21,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:25:21,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 60 [2025-03-09 01:25:21,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:25:25,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:25:33,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:25:37,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:25:41,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]