./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 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/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2261d9b3f7623cbd5155b35c39657066d179b87a48a9848bd1f196c713477a75 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:07:51,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:07:51,808 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:07:51,811 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:07:51,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:07:51,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:07:51,835 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:07:51,835 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:07:51,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:07:51,835 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:07:51,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:07:51,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:07:51,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:07:51,836 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:07:51,836 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:07:51,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:07:51,836 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:07:51,836 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:07:51,836 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:07:51,836 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:07:51,836 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:07:51,836 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:07:51,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:07:51,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:07:51,836 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:07:51,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:07:51,836 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:07:51,836 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:07:51,836 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:07:51,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:07:51,837 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:07:51,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:07:51,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:07:51,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:07:51,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:07:51,837 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:07:51,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:07:51,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:07:51,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:07:51,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:07:51,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:07:51,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:07:51,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:07:51,837 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 ! call(reach_error())) ) 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 -> 2261d9b3f7623cbd5155b35c39657066d179b87a48a9848bd1f196c713477a75 [2025-03-14 01:07:52,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:07:52,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:07:52,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:07:52,065 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:07:52,065 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:07:52,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c [2025-03-14 01:07:53,157 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12b8074f9/c1a6598b44454741986424876db7a6b3/FLAG84fbafe7d [2025-03-14 01:07:53,465 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:07:53,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c [2025-03-14 01:07:53,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12b8074f9/c1a6598b44454741986424876db7a6b3/FLAG84fbafe7d [2025-03-14 01:07:53,740 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12b8074f9/c1a6598b44454741986424876db7a6b3 [2025-03-14 01:07:53,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:07:53,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:07:53,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:07:53,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:07:53,749 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:07:53,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:07:53" (1/1) ... [2025-03-14 01:07:53,750 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f723c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:53, skipping insertion in model container [2025-03-14 01:07:53,750 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:07:53" (1/1) ... [2025-03-14 01:07:53,765 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:07:53,897 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c[2592,2605] [2025-03-14 01:07:53,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:07:53,917 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:07:53,933 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array.wvr.c[2592,2605] [2025-03-14 01:07:53,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:07:53,950 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:07:53,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:53 WrapperNode [2025-03-14 01:07:53,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:07:53,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:07:53,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:07:53,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:07:53,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:53" (1/1) ... [2025-03-14 01:07:53,963 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:53" (1/1) ... [2025-03-14 01:07:53,982 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 83 [2025-03-14 01:07:53,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:07:53,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:07:53,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:07:53,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:07:53,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:53" (1/1) ... [2025-03-14 01:07:53,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:53" (1/1) ... [2025-03-14 01:07:53,998 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:53" (1/1) ... [2025-03-14 01:07:54,015 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-14 01:07:54,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:53" (1/1) ... [2025-03-14 01:07:54,016 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:53" (1/1) ... [2025-03-14 01:07:54,024 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:53" (1/1) ... [2025-03-14 01:07:54,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:53" (1/1) ... [2025-03-14 01:07:54,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:53" (1/1) ... [2025-03-14 01:07:54,030 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:53" (1/1) ... [2025-03-14 01:07:54,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:07:54,035 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:07:54,036 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:07:54,036 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:07:54,037 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:53" (1/1) ... [2025-03-14 01:07:54,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:07:54,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:07:54,074 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-14 01:07:54,082 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-14 01:07:54,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:07:54,107 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:07:54,107 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:07:54,107 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:07:54,108 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:07:54,108 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:07:54,108 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:07:54,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:07:54,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 01:07:54,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 01:07:54,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 01:07:54,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:07:54,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:07:54,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:07:54,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:07:54,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:07:54,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 01:07:54,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 01:07:54,110 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:07:54,189 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:07:54,191 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:07:54,412 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:07:54,413 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:07:54,413 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:07:54,651 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:07:54,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:07:54 BoogieIcfgContainer [2025-03-14 01:07:54,652 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:07:54,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:07:54,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:07:54,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:07:54,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:07:53" (1/3) ... [2025-03-14 01:07:54,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69db0223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:07:54, skipping insertion in model container [2025-03-14 01:07:54,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:07:53" (2/3) ... [2025-03-14 01:07:54,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69db0223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:07:54, skipping insertion in model container [2025-03-14 01:07:54,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:07:54" (3/3) ... [2025-03-14 01:07:54,660 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2025-03-14 01:07:54,671 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:07:54,672 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-min-array.wvr.c that has 4 procedures, 30 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-14 01:07:54,672 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:07:54,728 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:07:54,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 87 flow [2025-03-14 01:07:54,787 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-03-14 01:07:54,791 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:07:54,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 4/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-03-14 01:07:54,796 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 87 flow [2025-03-14 01:07:54,799 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 76 flow [2025-03-14 01:07:54,806 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:07:54,841 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=LoopHeads, 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;@366b8bf6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:07:54,841 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 01:07:54,855 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:07:54,855 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-03-14 01:07:54,855 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:07:54,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:54,856 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:07:54,856 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:07:54,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:54,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1132871695, now seen corresponding path program 1 times [2025-03-14 01:07:54,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:54,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984002485] [2025-03-14 01:07:54,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:07:54,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:54,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-14 01:07:54,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-14 01:07:54,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:07:54,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:55,111 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-14 01:07:55,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:55,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984002485] [2025-03-14 01:07:55,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984002485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:07:55,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:07:55,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:07:55,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624866355] [2025-03-14 01:07:55,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:07:55,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:07:55,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:55,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:07:55,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:07:55,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-14 01:07:55,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-14 01:07:55,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:55,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-14 01:07:55,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:55,375 INFO L124 PetriNetUnfolderBase]: 617/954 cut-off events. [2025-03-14 01:07:55,376 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-14 01:07:55,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1949 conditions, 954 events. 617/954 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3774 event pairs, 126 based on Foata normal form. 1/950 useless extension candidates. Maximal degree in co-relation 1715. Up to 677 conditions per place. [2025-03-14 01:07:55,389 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 37 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2025-03-14 01:07:55,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 209 flow [2025-03-14 01:07:55,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:07:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:07:55,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-03-14 01:07:55,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2025-03-14 01:07:55,400 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 76 flow. Second operand 3 states and 64 transitions. [2025-03-14 01:07:55,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 209 flow [2025-03-14 01:07:55,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 187 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:07:55,410 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 90 flow [2025-03-14 01:07:55,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=32, PETRI_TRANSITIONS=32} [2025-03-14 01:07:55,418 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2025-03-14 01:07:55,418 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 90 flow [2025-03-14 01:07:55,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-14 01:07:55,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:55,418 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:07:55,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:07:55,419 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:07:55,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:55,419 INFO L85 PathProgramCache]: Analyzing trace with hash -110190373, now seen corresponding path program 1 times [2025-03-14 01:07:55,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:55,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866432849] [2025-03-14 01:07:55,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:07:55,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:55,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:07:55,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:07:55,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:07:55,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:07:55,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:55,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866432849] [2025-03-14 01:07:55,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866432849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:07:55,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:07:55,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:07:55,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009587593] [2025-03-14 01:07:55,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:07:55,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:07:55,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:55,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:07:55,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:07:55,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-14 01:07:55,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:07:55,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:55,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-14 01:07:55,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:55,780 INFO L124 PetriNetUnfolderBase]: 617/965 cut-off events. [2025-03-14 01:07:55,781 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2025-03-14 01:07:55,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2170 conditions, 965 events. 617/965 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4078 event pairs, 407 based on Foata normal form. 0/957 useless extension candidates. Maximal degree in co-relation 802. Up to 895 conditions per place. [2025-03-14 01:07:55,791 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 27 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2025-03-14 01:07:55,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 150 flow [2025-03-14 01:07:55,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:07:55,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:07:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-03-14 01:07:55,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-03-14 01:07:55,794 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 90 flow. Second operand 3 states and 48 transitions. [2025-03-14 01:07:55,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 150 flow [2025-03-14 01:07:55,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:07:55,797 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 98 flow [2025-03-14 01:07:55,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=34, PETRI_TRANSITIONS=33} [2025-03-14 01:07:55,798 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2025-03-14 01:07:55,798 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 98 flow [2025-03-14 01:07:55,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:07:55,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:55,799 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:07:55,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:07:55,799 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:07:55,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:55,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1070716047, now seen corresponding path program 1 times [2025-03-14 01:07:55,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:55,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731496421] [2025-03-14 01:07:55,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:07:55,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:55,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:07:55,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:07:55,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:07:55,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:07:55,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:55,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731496421] [2025-03-14 01:07:55,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731496421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:07:55,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:07:55,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:07:55,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296877610] [2025-03-14 01:07:55,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:07:55,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:07:55,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:55,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:07:55,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:07:55,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-14 01:07:55,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-14 01:07:55,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:55,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-14 01:07:55,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:56,085 INFO L124 PetriNetUnfolderBase]: 790/1161 cut-off events. [2025-03-14 01:07:56,086 INFO L125 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2025-03-14 01:07:56,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2575 conditions, 1161 events. 790/1161 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4572 event pairs, 246 based on Foata normal form. 0/1118 useless extension candidates. Maximal degree in co-relation 2562. Up to 576 conditions per place. [2025-03-14 01:07:56,094 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 40 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2025-03-14 01:07:56,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 224 flow [2025-03-14 01:07:56,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 01:07:56,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 01:07:56,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-03-14 01:07:56,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2025-03-14 01:07:56,096 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 98 flow. Second operand 4 states and 63 transitions. [2025-03-14 01:07:56,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 224 flow [2025-03-14 01:07:56,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 218 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-14 01:07:56,098 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 113 flow [2025-03-14 01:07:56,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2025-03-14 01:07:56,099 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-03-14 01:07:56,099 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 113 flow [2025-03-14 01:07:56,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-14 01:07:56,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:56,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:07:56,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:07:56,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:07:56,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:56,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1334506777, now seen corresponding path program 1 times [2025-03-14 01:07:56,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:56,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114382894] [2025-03-14 01:07:56,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:07:56,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:56,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:07:56,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:07:56,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:07:56,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:07:56,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:56,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114382894] [2025-03-14 01:07:56,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114382894] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:07:56,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821022204] [2025-03-14 01:07:56,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:07:56,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:07:56,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:07:56,238 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-14 01:07:56,241 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-14 01:07:56,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:07:56,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:07:56,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:07:56,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:56,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:07:56,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:07:56,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:07:56,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:07:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:07:56,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821022204] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:07:56,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:07:56,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-14 01:07:56,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173642252] [2025-03-14 01:07:56,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:07:56,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:07:56,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:56,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:07:56,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:07:56,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-14 01:07:56,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-14 01:07:56,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:56,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-14 01:07:56,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:07:56,593 INFO L124 PetriNetUnfolderBase]: 855/1295 cut-off events. [2025-03-14 01:07:56,593 INFO L125 PetriNetUnfolderBase]: For 505/505 co-relation queries the response was YES. [2025-03-14 01:07:56,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3247 conditions, 1295 events. 855/1295 cut-off events. For 505/505 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5382 event pairs, 256 based on Foata normal form. 0/1230 useless extension candidates. Maximal degree in co-relation 3227. Up to 670 conditions per place. [2025-03-14 01:07:56,602 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 41 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2025-03-14 01:07:56,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 257 flow [2025-03-14 01:07:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:07:56,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:07:56,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-03-14 01:07:56,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-03-14 01:07:56,604 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 113 flow. Second operand 5 states and 72 transitions. [2025-03-14 01:07:56,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 257 flow [2025-03-14 01:07:56,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:07:56,607 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 132 flow [2025-03-14 01:07:56,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-03-14 01:07:56,608 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-03-14 01:07:56,608 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 132 flow [2025-03-14 01:07:56,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-14 01:07:56,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:07:56,608 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:07:56,617 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-14 01:07:56,809 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-14 01:07:56,810 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:07:56,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:07:56,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1434408397, now seen corresponding path program 1 times [2025-03-14 01:07:56,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:07:56,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669111628] [2025-03-14 01:07:56,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:07:56,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:07:56,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:07:56,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:07:56,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:07:56,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:57,344 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-14 01:07:57,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:07:57,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669111628] [2025-03-14 01:07:57,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669111628] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:07:57,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352289382] [2025-03-14 01:07:57,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:07:57,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:07:57,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:07:57,347 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-14 01:07:57,348 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-14 01:07:57,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:07:57,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:07:57,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:07:57,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:07:57,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-14 01:07:57,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:07:57,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-03-14 01:07:57,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-03-14 01:07:57,772 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-14 01:07:57,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:07:58,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 105 [2025-03-14 01:07:58,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:07:58,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 149 [2025-03-14 01:07:59,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 85 [2025-03-14 01:07:59,304 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-03-14 01:07:59,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 103 [2025-03-14 01:07:59,648 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-14 01:07:59,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352289382] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:07:59,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:07:59,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2025-03-14 01:07:59,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2383336] [2025-03-14 01:07:59,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:07:59,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-14 01:07:59,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:07:59,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-14 01:07:59,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2025-03-14 01:07:59,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-14 01:07:59,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 132 flow. Second operand has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 states have internal predecessors, (208), 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-14 01:07:59,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:07:59,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-14 01:07:59,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:01,366 INFO L124 PetriNetUnfolderBase]: 1841/2761 cut-off events. [2025-03-14 01:08:01,367 INFO L125 PetriNetUnfolderBase]: For 1721/1721 co-relation queries the response was YES. [2025-03-14 01:08:01,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7669 conditions, 2761 events. 1841/2761 cut-off events. For 1721/1721 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12695 event pairs, 106 based on Foata normal form. 1/2761 useless extension candidates. Maximal degree in co-relation 5614. Up to 1375 conditions per place. [2025-03-14 01:08:01,383 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 137 selfloop transitions, 57 changer transitions 1/199 dead transitions. [2025-03-14 01:08:01,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 199 transitions, 1067 flow [2025-03-14 01:08:01,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 01:08:01,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 01:08:01,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 321 transitions. [2025-03-14 01:08:01,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46320346320346323 [2025-03-14 01:08:01,385 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 132 flow. Second operand 21 states and 321 transitions. [2025-03-14 01:08:01,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 199 transitions, 1067 flow [2025-03-14 01:08:01,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 199 transitions, 1050 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:08:01,391 INFO L231 Difference]: Finished difference. Result has 64 places, 91 transitions, 543 flow [2025-03-14 01:08:01,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=543, PETRI_PLACES=64, PETRI_TRANSITIONS=91} [2025-03-14 01:08:01,391 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2025-03-14 01:08:01,391 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 91 transitions, 543 flow [2025-03-14 01:08:01,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.666666666666666) internal successors, (208), 24 states have internal predecessors, (208), 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-14 01:08:01,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:01,392 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:08:01,398 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-14 01:08:01,592 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-14 01:08:01,592 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:08:01,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:01,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1109207333, now seen corresponding path program 2 times [2025-03-14 01:08:01,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:01,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297547238] [2025-03-14 01:08:01,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:08:01,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:01,600 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:08:01,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:08:01,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:08:01,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:02,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:02,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297547238] [2025-03-14 01:08:02,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297547238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:02,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628525633] [2025-03-14 01:08:02,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:08:02,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:02,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:02,091 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-14 01:08:02,092 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-14 01:08:02,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:08:02,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:08:02,146 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:08:02,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:02,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-14 01:08:02,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:08:02,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-03-14 01:08:02,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2025-03-14 01:08:02,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:08:02,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:08:02,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 85 [2025-03-14 01:08:02,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:08:02,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 111 [2025-03-14 01:08:03,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 105 [2025-03-14 01:08:03,531 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-03-14 01:08:03,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 1 [2025-03-14 01:08:03,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:08:03,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628525633] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:08:03,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:08:03,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2025-03-14 01:08:03,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75015138] [2025-03-14 01:08:03,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:08:03,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 01:08:03,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:03,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 01:08:03,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2025-03-14 01:08:03,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-14 01:08:03,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 91 transitions, 543 flow. Second operand has 20 states, 20 states have (on average 9.9) internal successors, (198), 20 states have internal predecessors, (198), 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-14 01:08:03,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:03,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-14 01:08:03,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:04,990 INFO L124 PetriNetUnfolderBase]: 2050/3331 cut-off events. [2025-03-14 01:08:04,991 INFO L125 PetriNetUnfolderBase]: For 4756/4756 co-relation queries the response was YES. [2025-03-14 01:08:04,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10808 conditions, 3331 events. 2050/3331 cut-off events. For 4756/4756 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 17976 event pairs, 80 based on Foata normal form. 3/3332 useless extension candidates. Maximal degree in co-relation 10246. Up to 1815 conditions per place. [2025-03-14 01:08:05,013 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 193 selfloop transitions, 121 changer transitions 2/322 dead transitions. [2025-03-14 01:08:05,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 322 transitions, 2167 flow [2025-03-14 01:08:05,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-14 01:08:05,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-14 01:08:05,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 474 transitions. [2025-03-14 01:08:05,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4633431085043988 [2025-03-14 01:08:05,016 INFO L175 Difference]: Start difference. First operand has 64 places, 91 transitions, 543 flow. Second operand 31 states and 474 transitions. [2025-03-14 01:08:05,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 322 transitions, 2167 flow [2025-03-14 01:08:05,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 322 transitions, 1959 flow, removed 77 selfloop flow, removed 3 redundant places. [2025-03-14 01:08:05,040 INFO L231 Difference]: Finished difference. Result has 105 places, 182 transitions, 1307 flow [2025-03-14 01:08:05,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1307, PETRI_PLACES=105, PETRI_TRANSITIONS=182} [2025-03-14 01:08:05,043 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 70 predicate places. [2025-03-14 01:08:05,043 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 182 transitions, 1307 flow [2025-03-14 01:08:05,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.9) internal successors, (198), 20 states have internal predecessors, (198), 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-14 01:08:05,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:05,045 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:08:05,052 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-14 01:08:05,247 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-14 01:08:05,248 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:08:05,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:05,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2063529431, now seen corresponding path program 3 times [2025-03-14 01:08:05,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:05,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361294850] [2025-03-14 01:08:05,248 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:08:05,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:05,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:08:05,279 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:08:05,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:08:05,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:05,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:05,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361294850] [2025-03-14 01:08:05,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361294850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:05,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021952354] [2025-03-14 01:08:05,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:08:05,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:05,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:05,699 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-14 01:08:05,700 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-14 01:08:05,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:08:05,761 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:08:05,761 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:08:05,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:05,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-14 01:08:05,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:08:05,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-03-14 01:08:05,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-03-14 01:08:05,975 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-14 01:08:05,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:08:06,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2025-03-14 01:08:06,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:08:06,522 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 83 treesize of output 79 [2025-03-14 01:08:06,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2025-03-14 01:08:06,641 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:08:06,641 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 64 treesize of output 1 [2025-03-14 01:08:06,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2025-03-14 01:08:06,657 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:08:06,657 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 100 treesize of output 1 [2025-03-14 01:08:06,681 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-14 01:08:06,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021952354] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:08:06,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:08:06,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2025-03-14 01:08:06,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611267121] [2025-03-14 01:08:06,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:08:06,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-14 01:08:06,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:06,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-14 01:08:06,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2025-03-14 01:08:06,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-14 01:08:06,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 182 transitions, 1307 flow. Second operand has 22 states, 22 states have (on average 9.681818181818182) internal successors, (213), 22 states have internal predecessors, (213), 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-14 01:08:06,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:06,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-14 01:08:06,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:08,652 INFO L124 PetriNetUnfolderBase]: 3977/6429 cut-off events. [2025-03-14 01:08:08,652 INFO L125 PetriNetUnfolderBase]: For 17187/17234 co-relation queries the response was YES. [2025-03-14 01:08:08,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24759 conditions, 6429 events. 3977/6429 cut-off events. For 17187/17234 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 39117 event pairs, 281 based on Foata normal form. 28/6454 useless extension candidates. Maximal degree in co-relation 23621. Up to 2818 conditions per place. [2025-03-14 01:08:08,709 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 242 selfloop transitions, 255 changer transitions 2/505 dead transitions. [2025-03-14 01:08:08,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 505 transitions, 4211 flow [2025-03-14 01:08:08,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-14 01:08:08,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-14 01:08:08,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 542 transitions. [2025-03-14 01:08:08,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4692640692640693 [2025-03-14 01:08:08,712 INFO L175 Difference]: Start difference. First operand has 105 places, 182 transitions, 1307 flow. Second operand 35 states and 542 transitions. [2025-03-14 01:08:08,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 505 transitions, 4211 flow [2025-03-14 01:08:08,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 505 transitions, 4018 flow, removed 94 selfloop flow, removed 2 redundant places. [2025-03-14 01:08:08,751 INFO L231 Difference]: Finished difference. Result has 149 places, 342 transitions, 3150 flow [2025-03-14 01:08:08,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=3150, PETRI_PLACES=149, PETRI_TRANSITIONS=342} [2025-03-14 01:08:08,752 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 114 predicate places. [2025-03-14 01:08:08,752 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 342 transitions, 3150 flow [2025-03-14 01:08:08,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.681818181818182) internal successors, (213), 22 states have internal predecessors, (213), 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-14 01:08:08,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:08,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:08:08,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 01:08:08,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:08,958 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:08:08,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:08,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2082405221, now seen corresponding path program 4 times [2025-03-14 01:08:08,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:08,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028757573] [2025-03-14 01:08:08,959 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:08:08,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:08,965 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:08:08,972 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:08:08,972 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:08:08,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:09,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:09,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:09,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028757573] [2025-03-14 01:08:09,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028757573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:09,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:09,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 01:08:09,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946058847] [2025-03-14 01:08:09,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:09,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:08:09,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:09,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:08:09,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:08:09,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-14 01:08:09,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 342 transitions, 3150 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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-14 01:08:09,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:09,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-14 01:08:09,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:10,134 INFO L124 PetriNetUnfolderBase]: 5274/8367 cut-off events. [2025-03-14 01:08:10,135 INFO L125 PetriNetUnfolderBase]: For 30449/30465 co-relation queries the response was YES. [2025-03-14 01:08:10,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35710 conditions, 8367 events. 5274/8367 cut-off events. For 30449/30465 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 52161 event pairs, 1315 based on Foata normal form. 13/8377 useless extension candidates. Maximal degree in co-relation 34572. Up to 7232 conditions per place. [2025-03-14 01:08:10,189 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 323 selfloop transitions, 91 changer transitions 1/420 dead transitions. [2025-03-14 01:08:10,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 420 transitions, 4572 flow [2025-03-14 01:08:10,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 01:08:10,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 01:08:10,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 167 transitions. [2025-03-14 01:08:10,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38927738927738925 [2025-03-14 01:08:10,191 INFO L175 Difference]: Start difference. First operand has 149 places, 342 transitions, 3150 flow. Second operand 13 states and 167 transitions. [2025-03-14 01:08:10,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 420 transitions, 4572 flow [2025-03-14 01:08:10,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 420 transitions, 4336 flow, removed 60 selfloop flow, removed 12 redundant places. [2025-03-14 01:08:10,288 INFO L231 Difference]: Finished difference. Result has 156 places, 385 transitions, 3636 flow [2025-03-14 01:08:10,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2938, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3636, PETRI_PLACES=156, PETRI_TRANSITIONS=385} [2025-03-14 01:08:10,289 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 121 predicate places. [2025-03-14 01:08:10,289 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 385 transitions, 3636 flow [2025-03-14 01:08:10,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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-14 01:08:10,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:10,289 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:08:10,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:08:10,290 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:08:10,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:10,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1386513495, now seen corresponding path program 5 times [2025-03-14 01:08:10,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:10,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809626850] [2025-03-14 01:08:10,291 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:08:10,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:10,296 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:08:10,317 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:08:10,317 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:08:10,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:10,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:08:10,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:10,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809626850] [2025-03-14 01:08:10,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809626850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:10,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627332943] [2025-03-14 01:08:10,700 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:08:10,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:10,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:10,702 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-14 01:08:10,703 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-14 01:08:10,741 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:08:10,755 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:08:10,755 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:08:10,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:10,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-14 01:08:10,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:08:10,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-03-14 01:08:11,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-03-14 01:08:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:08:11,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:08:11,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2025-03-14 01:08:11,755 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-14 01:08:11,756 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 100 treesize of output 79 [2025-03-14 01:08:11,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2025-03-14 01:08:11,852 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:08:11,852 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 64 treesize of output 54 [2025-03-14 01:08:11,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2025-03-14 01:08:11,957 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:08:11,958 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 83 treesize of output 75 [2025-03-14 01:08:12,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:08:12,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627332943] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:08:12,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:08:12,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2025-03-14 01:08:12,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901084475] [2025-03-14 01:08:12,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:08:12,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-14 01:08:12,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:12,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-14 01:08:12,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2025-03-14 01:08:12,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-14 01:08:12,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 385 transitions, 3636 flow. Second operand has 26 states, 26 states have (on average 7.730769230769231) internal successors, (201), 26 states have internal predecessors, (201), 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-14 01:08:12,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:12,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-14 01:08:12,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:15,852 INFO L124 PetriNetUnfolderBase]: 10278/14927 cut-off events. [2025-03-14 01:08:15,852 INFO L125 PetriNetUnfolderBase]: For 53186/53186 co-relation queries the response was YES. [2025-03-14 01:08:15,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64578 conditions, 14927 events. 10278/14927 cut-off events. For 53186/53186 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 86712 event pairs, 1526 based on Foata normal form. 3/14927 useless extension candidates. Maximal degree in co-relation 63488. Up to 9483 conditions per place. [2025-03-14 01:08:15,953 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 446 selfloop transitions, 398 changer transitions 2/848 dead transitions. [2025-03-14 01:08:15,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 848 transitions, 9057 flow [2025-03-14 01:08:15,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-14 01:08:15,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-14 01:08:15,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 493 transitions. [2025-03-14 01:08:15,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4037674037674038 [2025-03-14 01:08:15,958 INFO L175 Difference]: Start difference. First operand has 156 places, 385 transitions, 3636 flow. Second operand 37 states and 493 transitions. [2025-03-14 01:08:15,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 848 transitions, 9057 flow [2025-03-14 01:08:16,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 848 transitions, 8809 flow, removed 93 selfloop flow, removed 1 redundant places. [2025-03-14 01:08:16,196 INFO L231 Difference]: Finished difference. Result has 211 places, 659 transitions, 7739 flow [2025-03-14 01:08:16,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3530, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=7739, PETRI_PLACES=211, PETRI_TRANSITIONS=659} [2025-03-14 01:08:16,198 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 176 predicate places. [2025-03-14 01:08:16,200 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 659 transitions, 7739 flow [2025-03-14 01:08:16,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.730769230769231) internal successors, (201), 26 states have internal predecessors, (201), 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-14 01:08:16,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:16,201 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:08:16,213 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-14 01:08:16,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:16,402 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:08:16,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:16,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1923897521, now seen corresponding path program 6 times [2025-03-14 01:08:16,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:16,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979331058] [2025-03-14 01:08:16,402 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:08:16,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:16,413 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:08:16,423 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:08:16,425 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-14 01:08:16,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:16,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:16,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979331058] [2025-03-14 01:08:16,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979331058] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:16,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054462286] [2025-03-14 01:08:16,729 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:08:16,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:16,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:16,733 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-14 01:08:16,735 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-14 01:08:16,777 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-03-14 01:08:16,793 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:08:16,794 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-14 01:08:16,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:16,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-14 01:08:16,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:08:16,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-03-14 01:08:17,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:08:17,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:08:17,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:08:17,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 49 [2025-03-14 01:08:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:08:17,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054462286] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:08:17,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:08:17,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2025-03-14 01:08:17,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474558645] [2025-03-14 01:08:17,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:08:17,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-14 01:08:17,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:17,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-14 01:08:17,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2025-03-14 01:08:17,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-14 01:08:17,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 659 transitions, 7739 flow. Second operand has 23 states, 23 states have (on average 9.652173913043478) internal successors, (222), 23 states have internal predecessors, (222), 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-14 01:08:17,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:17,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-14 01:08:17,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:19,623 INFO L124 PetriNetUnfolderBase]: 7795/12170 cut-off events. [2025-03-14 01:08:19,623 INFO L125 PetriNetUnfolderBase]: For 71593/72091 co-relation queries the response was YES. [2025-03-14 01:08:19,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64395 conditions, 12170 events. 7795/12170 cut-off events. For 71593/72091 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 79368 event pairs, 721 based on Foata normal form. 340/12382 useless extension candidates. Maximal degree in co-relation 63913. Up to 6784 conditions per place. [2025-03-14 01:08:19,767 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 390 selfloop transitions, 453 changer transitions 1/862 dead transitions. [2025-03-14 01:08:19,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 862 transitions, 11109 flow [2025-03-14 01:08:19,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-14 01:08:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-14 01:08:19,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 416 transitions. [2025-03-14 01:08:19,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4346917450365726 [2025-03-14 01:08:19,775 INFO L175 Difference]: Start difference. First operand has 211 places, 659 transitions, 7739 flow. Second operand 29 states and 416 transitions. [2025-03-14 01:08:19,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 862 transitions, 11109 flow [2025-03-14 01:08:20,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 862 transitions, 10712 flow, removed 117 selfloop flow, removed 8 redundant places. [2025-03-14 01:08:20,175 INFO L231 Difference]: Finished difference. Result has 237 places, 756 transitions, 9869 flow [2025-03-14 01:08:20,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=7402, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=368, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=9869, PETRI_PLACES=237, PETRI_TRANSITIONS=756} [2025-03-14 01:08:20,176 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 202 predicate places. [2025-03-14 01:08:20,176 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 756 transitions, 9869 flow [2025-03-14 01:08:20,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.652173913043478) internal successors, (222), 23 states have internal predecessors, (222), 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-14 01:08:20,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:20,176 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:08:20,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-14 01:08:20,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:20,376 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:08:20,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:20,377 INFO L85 PathProgramCache]: Analyzing trace with hash 128833131, now seen corresponding path program 7 times [2025-03-14 01:08:20,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:20,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389991764] [2025-03-14 01:08:20,377 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:08:20,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:20,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 01:08:20,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:08:20,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:20,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:20,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:20,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389991764] [2025-03-14 01:08:20,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389991764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:20,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112931723] [2025-03-14 01:08:20,437 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:08:20,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:20,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:20,439 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-14 01:08:20,441 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-14 01:08:20,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 01:08:20,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:08:20,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:20,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:20,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:08:20,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:08:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:20,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:08:20,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:20,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112931723] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:08:20,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:08:20,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-14 01:08:20,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698246283] [2025-03-14 01:08:20,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:08:20,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 01:08:20,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:20,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 01:08:20,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-14 01:08:20,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-14 01:08:20,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 756 transitions, 9869 flow. Second operand has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 14 states have internal predecessors, (124), 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-14 01:08:20,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:20,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-14 01:08:20,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:22,937 INFO L124 PetriNetUnfolderBase]: 10598/16072 cut-off events. [2025-03-14 01:08:22,937 INFO L125 PetriNetUnfolderBase]: For 114779/115154 co-relation queries the response was YES. [2025-03-14 01:08:23,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90211 conditions, 16072 events. 10598/16072 cut-off events. For 114779/115154 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 104832 event pairs, 2138 based on Foata normal form. 330/16381 useless extension candidates. Maximal degree in co-relation 89753. Up to 5466 conditions per place. [2025-03-14 01:08:23,052 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 897 selfloop transitions, 100 changer transitions 0/1005 dead transitions. [2025-03-14 01:08:23,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 1005 transitions, 14844 flow [2025-03-14 01:08:23,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 01:08:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 01:08:23,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2025-03-14 01:08:23,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5181818181818182 [2025-03-14 01:08:23,053 INFO L175 Difference]: Start difference. First operand has 237 places, 756 transitions, 9869 flow. Second operand 10 states and 171 transitions. [2025-03-14 01:08:23,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 1005 transitions, 14844 flow [2025-03-14 01:08:23,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 1005 transitions, 14663 flow, removed 25 selfloop flow, removed 15 redundant places. [2025-03-14 01:08:23,611 INFO L231 Difference]: Finished difference. Result has 234 places, 771 transitions, 10237 flow [2025-03-14 01:08:23,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=9670, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=753, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10237, PETRI_PLACES=234, PETRI_TRANSITIONS=771} [2025-03-14 01:08:23,612 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 199 predicate places. [2025-03-14 01:08:23,612 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 771 transitions, 10237 flow [2025-03-14 01:08:23,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 14 states have internal predecessors, (124), 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-14 01:08:23,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:23,612 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:08:23,619 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-14 01:08:23,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:23,812 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:08:23,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:23,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1508234149, now seen corresponding path program 8 times [2025-03-14 01:08:23,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:23,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570238014] [2025-03-14 01:08:23,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:08:23,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:23,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-14 01:08:23,823 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 01:08:23,824 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:08:23,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:23,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:23,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:23,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570238014] [2025-03-14 01:08:23,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570238014] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:23,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691199055] [2025-03-14 01:08:23,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:08:23,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:23,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:23,883 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-14 01:08:23,884 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-14 01:08:23,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-14 01:08:23,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 01:08:23,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:08:23,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:23,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:08:23,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:08:24,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:24,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:08:24,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:24,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691199055] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:08:24,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:08:24,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-14 01:08:24,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955164418] [2025-03-14 01:08:24,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:08:24,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-14 01:08:24,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:24,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-14 01:08:24,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-14 01:08:24,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-14 01:08:24,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 771 transitions, 10237 flow. Second operand has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 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-14 01:08:24,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:24,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-14 01:08:24,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:29,251 INFO L124 PetriNetUnfolderBase]: 22376/32287 cut-off events. [2025-03-14 01:08:29,251 INFO L125 PetriNetUnfolderBase]: For 279910/279910 co-relation queries the response was YES. [2025-03-14 01:08:29,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181518 conditions, 32287 events. 22376/32287 cut-off events. For 279910/279910 co-relation queries the response was YES. Maximal size of possible extension queue 1363. Compared 207428 event pairs, 3564 based on Foata normal form. 30/32317 useless extension candidates. Maximal degree in co-relation 180583. Up to 8683 conditions per place. [2025-03-14 01:08:29,655 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 1896 selfloop transitions, 356 changer transitions 0/2253 dead transitions. [2025-03-14 01:08:29,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 2253 transitions, 35170 flow [2025-03-14 01:08:29,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 01:08:29,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 01:08:29,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 261 transitions. [2025-03-14 01:08:29,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41626794258373206 [2025-03-14 01:08:29,657 INFO L175 Difference]: Start difference. First operand has 234 places, 771 transitions, 10237 flow. Second operand 19 states and 261 transitions. [2025-03-14 01:08:29,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 2253 transitions, 35170 flow [2025-03-14 01:08:31,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 2253 transitions, 35117 flow, removed 23 selfloop flow, removed 3 redundant places. [2025-03-14 01:08:31,243 INFO L231 Difference]: Finished difference. Result has 263 places, 1037 transitions, 15498 flow [2025-03-14 01:08:31,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=10222, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=771, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=15498, PETRI_PLACES=263, PETRI_TRANSITIONS=1037} [2025-03-14 01:08:31,245 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 228 predicate places. [2025-03-14 01:08:31,245 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 1037 transitions, 15498 flow [2025-03-14 01:08:31,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 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-14 01:08:31,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:31,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:08:31,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-14 01:08:31,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-14 01:08:31,446 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:08:31,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:31,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1612780034, now seen corresponding path program 1 times [2025-03-14 01:08:31,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:31,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811863706] [2025-03-14 01:08:31,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:08:31,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:31,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-14 01:08:31,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 01:08:31,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:31,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:31,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:31,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811863706] [2025-03-14 01:08:31,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811863706] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:31,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991160746] [2025-03-14 01:08:31,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:08:31,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:31,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:31,507 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:08:31,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-14 01:08:31,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-14 01:08:31,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 01:08:31,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:31,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:31,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:08:31,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:08:31,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:31,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:08:31,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:31,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991160746] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:08:31,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:08:31,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-14 01:08:31,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092564449] [2025-03-14 01:08:31,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:08:31,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 01:08:31,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:31,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 01:08:31,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:08:31,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-14 01:08:31,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 1037 transitions, 15498 flow. Second operand has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 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-14 01:08:31,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:31,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-14 01:08:31,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:33,215 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([349] L71-->L70-3: Formula: (let ((.cse0 (select (select |v_#memory_int#1_59| v_~A~0.base_111) (+ v_~A~0.offset_111 (* v_thread3Thread1of1ForFork2_~i~2_7 4))))) (or (and (<= v_~min2~0_100 .cse0) (= |v_thread3Thread1of1ForFork2_#t~mem8_2| |v_thread3Thread1of1ForFork2_#t~mem8_1|) (= v_~min2~0_100 v_~min2~0_99)) (and (= .cse0 v_~min2~0_99) (< .cse0 v_~min2~0_100)))) InVars {thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_1|, ~A~0.base=v_~A~0.base_111, ~A~0.offset=v_~A~0.offset_111, #memory_int#1=|v_#memory_int#1_59|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7, ~min2~0=v_~min2~0_100} OutVars{~A~0.base=v_~A~0.base_111, ~A~0.offset=v_~A~0.offset_111, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_2|, thread3Thread1of1ForFork2_#t~mem7=|v_thread3Thread1of1ForFork2_#t~mem7_1|, #memory_int#1=|v_#memory_int#1_59|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7, ~min2~0=v_~min2~0_99} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~mem7, ~min2~0][343], [1722#(and (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 638#true, 21#thread2EXITtrue, 416#true, Black: 382#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= ~N~0 1) (= ~M~0 0)), Black: 347#(and (or (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 ~min1~0))))), Black: 380#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 384#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= ~N~0 1) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), 893#true, Black: 410#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), 9#L47true, 26#L95true, Black: 48#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| ~N~0) |ULTIMATE.start_create_fresh_int_array_~size#1|), Black: 52#(<= (+ ~M~0 1) ~N~0), Black: 1197#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int#1| ~A~0.base) 0) 1) 0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (= ~min2~0 0) (<= 0 (select (select |#memory_int#1| ~A~0.base) 0))))), Black: 1341#(and (= ~A~0.offset 0) (or (= ~min2~0 0) (< ~min2~0 0)) (or (and (= ~min2~0 0) (<= 0 (select (select |#memory_int#1| ~A~0.base) 0))) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) 0))) (= ~min2~0 ~min1~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1349#(and (= ~A~0.offset 0) (or (= ~min2~0 0) (< ~min2~0 0)) (or (and (= ~min2~0 0) (<= 0 (select (select |#memory_int#1| ~A~0.base) 0))) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) 0))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min2~0 ~min1~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 61#(<= 1 ~N~0), Black: 1204#(and (= ~min1~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int#1| ~A~0.base) 0) 1) 0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (= ~min2~0 0) (<= 0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1347#(and (= ~A~0.offset 0) (or (and (= ~min2~0 0) (<= 0 (select (select |#memory_int#1| ~A~0.base) 0))) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) 0))) (or (and (= ~min2~0 ~min1~0) (<= (+ ~min2~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0)))), Black: 1351#(and (= ~A~0.offset 0) (or (= ~min2~0 0) (< ~min2~0 0)) (or (and (= ~min2~0 0) (<= 0 (select (select |#memory_int#1| ~A~0.base) 0))) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) 0))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min2~0 ~min1~0)), Black: 1733#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= 2 ~N~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1595#(and (<= 2 ~N~0) (<= ~M~0 0)), Black: 1539#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= ~M~0 0)), Black: 1720#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1731#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1741#(and (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1737#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork2_~i~2 1) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1729#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 1724#(and (= thread1Thread1of1ForFork1_~i~0 0) (<= ~M~0 0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 827#(and (= ~min1~0 0) (= ~A~0.offset 0) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (* ~M~0 4))) (or (and (<= (+ (select (select |#memory_int#1| ~A~0.base) 0) 1) 0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) 0))) (and (= ~min2~0 0) (<= 0 (select (select |#memory_int#1| ~A~0.base) 0)))) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1537#(= thread2Thread1of1ForFork0_~i~1 0), Black: 1588#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= ~M~0 0)), Black: 1538#(<= ~M~0 0), Black: 843#(and (or (and (= ~min1~0 0) (= ~min2~0 0)) (and (<= (+ ~min1~0 1) 0) (= ~min2~0 ~min1~0))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 1726#(and (<= 1 thread1Thread1of1ForFork1_~i~0) (<= 2 ~N~0) (<= ~M~0 0)), Black: 831#(and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1)) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) ~min2~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0))))), 1141#true, Black: 644#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 777#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))))), Black: 819#(and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0)) (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)))) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0))))), Black: 1011#(and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1)))), Black: 849#(and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1)))), Black: 901#(or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))))), Black: 855#(and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (= ~min2~0 ~min1~0) (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))), Black: 833#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0)) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1072#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (= ~M~0 0)), Black: 1076#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~N~0 1) (= thread1Thread1of1ForFork1_~i~0 0) (<= 0 thread3Thread1of1ForFork2_~i~2) (= ~M~0 0)), Black: 1108#(and (or (= ~min2~0 ~min1~0) (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0)) (or (< (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1)))), Black: 1116#(and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork2_~i~2_28 Int)) (or (< v_thread3Thread1of1ForFork2_~i~2_28 ~M~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_28 4) ~A~0.offset)) 1)) (< ~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_28 1))))) (or (= ~min2~0 0) (< ~min2~0 0)) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (= ~min2~0 ~min1~0) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_28 Int)) (or (< v_thread3Thread1of1ForFork2_~i~2_28 ~M~0) (< ~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_28 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_28 4) ~A~0.offset)) ~min2~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_28 Int)) (or (< v_thread3Thread1of1ForFork2_~i~2_28 ~M~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_28 4) ~A~0.offset)) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_28 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_28 1)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), 1938#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~M~0 0)), Black: 1078#(and (or (< 0 thread3Thread1of1ForFork2_~i~2) (= (+ ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (+ ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (<= 0 ~M~0) (or (and (= ~min2~0 ~min1~0) (<= (+ ~min2~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0))) (or (< thread1Thread1of1ForFork1_~i~0 thread3Thread1of1ForFork2_~i~2) (= (+ ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (+ ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))))), Black: 1032#(or (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) ~min2~0)) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1)))) (< ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))), Black: 1118#(and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork2_~i~2_28 Int)) (or (< v_thread3Thread1of1ForFork2_~i~2_28 ~M~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_28 4) ~A~0.offset)) 1)) (< ~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_28 1))))) (or (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) ~min2~0) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))) (< ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))) (or (and (= ~min2~0 ~min1~0) (<= (+ ~min2~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0))) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_28 Int)) (or (< v_thread3Thread1of1ForFork2_~i~2_28 ~M~0) (< ~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_28 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_28 4) ~A~0.offset)) ~min2~0))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_28 Int)) (or (< v_thread3Thread1of1ForFork2_~i~2_28 ~M~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_28 4) ~A~0.offset)) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_28 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_28 1)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1)))), Black: 1080#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~N~0 1) (or (= (select (select |#memory_int#1| ~A~0.base) (* thread1Thread1of1ForFork1_~i~0 4)) (select (select |#memory_int#1| ~A~0.base) (* thread3Thread1of1ForFork2_~i~2 4))) (< thread1Thread1of1ForFork1_~i~0 thread3Thread1of1ForFork2_~i~2)) (<= 0 thread3Thread1of1ForFork2_~i~2) (= ~M~0 0)), Black: 1074#(and (or (< 0 thread3Thread1of1ForFork2_~i~2) (= (+ ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))) (+ ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (<= 0 ~M~0) (or (and (= ~min2~0 ~min1~0) (<= (+ ~min2~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0)))), Black: 1094#(and (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~min2~0 ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork2_~i~2_28 Int)) (or (< v_thread3Thread1of1ForFork2_~i~2_28 ~M~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_28 4) ~A~0.offset)) 1)) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_28 4) ~A~0.offset))) (< ~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_28 1))))) (or (< ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1)) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) ~min2~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))))))) (or (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) ~min2~0)) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1)))) (< ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_28 Int)) (or (< v_thread3Thread1of1ForFork2_~i~2_28 ~M~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_28 4) ~A~0.offset)) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_28 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_28 1)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (forall ((v_thread3Thread1of1ForFork2_~i~2_28 Int)) (or (< v_thread3Thread1of1ForFork2_~i~2_28 ~M~0) (< ~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_28 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_28 4) ~A~0.offset)) ~min2~0))))), Black: 1090#(and (or (< ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)) (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1)) (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)))))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) ~min2~0) (and (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) ~min1~0) (= ~min2~0 ~min1~0)) (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 1))))))) (or (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) ~min2~0)) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1)))) (< ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)))), 203#true, 1364#(<= (+ thread1Thread1of1ForFork1_~i~0 1) ~N~0), Black: 424#(and (or (= ~min1~0 0) (< (select (select |#memory_int#1| ~A~0.base) 0) 0)) (= ~min2~0 0) (= ~A~0.offset 0) (or (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (select (select |#memory_int#1| ~A~0.base) 0))) (= ~M~0 0)), Black: 1104#(and (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (forall ((v_thread3Thread1of1ForFork2_~i~2_28 Int)) (or (< v_thread3Thread1of1ForFork2_~i~2_28 ~M~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_28 4) ~A~0.offset)) 1)) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_28 4) ~A~0.offset))) (< ~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_28 1))))) (or (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) ~min2~0)) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1)))) (< ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1))) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_28 Int)) (or (< v_thread3Thread1of1ForFork2_~i~2_28 ~M~0) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_28 4) ~A~0.offset)) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_28 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_28 1)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (forall ((v_thread3Thread1of1ForFork2_~i~2_28 Int)) (or (< v_thread3Thread1of1ForFork2_~i~2_28 ~M~0) (< ~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_28 1)) (< (select (select |#memory_int#1| ~A~0.base) (+ (* v_thread3Thread1of1ForFork2_~i~2_28 4) ~A~0.offset)) ~min2~0))))), Black: 623#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0)), Black: 903#(or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~min2~0 ~min1~0)), 34#L70-3true, Black: 553#(and (or (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset))) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)))) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 ~min1~0))))), Black: 1096#(and (or (< thread1Thread1of1ForFork1_~i~0 ~N~0) (= ~min2~0 ~min1~0)) (or (and (or (and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) ~min2~0)) (or (and (or (= (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset))))) (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~A~0.offset)) 1)))) (< ~N~0 (+ thread3Thread1of1ForFork2_~i~2 1)))), Black: 1070#(and (<= 0 ~M~0) (or (and (= ~min2~0 ~min1~0) (<= (+ ~min2~0 1) 0)) (and (= ~min1~0 0) (= ~min2~0 0)))), Black: 587#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~M~0 0)), Black: 419#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0)), Black: 591#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= ~M~0 0)), Black: 603#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0)) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 ~min1~0))), Black: 879#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~min2~0 ~min1~0) (= ~M~0 0)), Black: 420#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 874#(and (= thread3Thread1of1ForFork2_~i~2 0) (= ~min2~0 ~min1~0)), Black: 593#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread2Thread1of1ForFork0_~i~1 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 873#(and (= ~min2~0 ~min1~0) (= ~M~0 0)), Black: 613#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (<= ~min2~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (= ~min2~0 ~min1~0) (or (= ~min1~0 0) (< ~min1~0 0))), Black: 885#(and (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 876#(and (or (= ~min2~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (< ~min1~0 (+ (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) 1))) (or (< (select (select |#memory_int#1| ~A~0.base) ~A~0.offset) ~min1~0) (= ~min2~0 ~min1~0)) (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork1_~i~0 0)), 868#true, Black: 423#(and (or (= ~min1~0 0) (< (select (select |#memory_int#1| ~A~0.base) 0) 0)) (= ~min2~0 0) (= ~A~0.offset 0) (or (= ~min1~0 (select (select |#memory_int#1| ~A~0.base) 0)) (< 0 (select (select |#memory_int#1| ~A~0.base) 0))) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 870#(= ~min2~0 ~min1~0), Black: 597#(and (or (< ~min2~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1)) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min1~0)) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4)))) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~min2~0) (= ~min2~0 ~min1~0))), Black: 883#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~min1~0 (select (select |#memory_int#1| ~A~0.base) ~A~0.offset)) (= ~min2~0 ~min1~0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 1358#true, Black: 589#(and (or (< ~N~0 2) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork1_~i~0 0) (= ~M~0 0)), Black: 1362#(<= 2 ~N~0), Black: 1410#(and (<= 2 ~N~0) (<= thread1Thread1of1ForFork1_~i~0 1))]) [2025-03-14 01:08:33,216 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2025-03-14 01:08:33,216 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-14 01:08:33,216 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-14 01:08:33,216 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2025-03-14 01:08:34,692 INFO L124 PetriNetUnfolderBase]: 9265/14579 cut-off events. [2025-03-14 01:08:34,693 INFO L125 PetriNetUnfolderBase]: For 205976/207521 co-relation queries the response was YES. [2025-03-14 01:08:34,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102416 conditions, 14579 events. 9265/14579 cut-off events. For 205976/207521 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 99605 event pairs, 3593 based on Foata normal form. 1189/15560 useless extension candidates. Maximal degree in co-relation 102328. Up to 6793 conditions per place. [2025-03-14 01:08:34,890 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 809 selfloop transitions, 24 changer transitions 0/894 dead transitions. [2025-03-14 01:08:34,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 894 transitions, 15739 flow [2025-03-14 01:08:34,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:08:34,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:08:34,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-03-14 01:08:34,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2025-03-14 01:08:34,892 INFO L175 Difference]: Start difference. First operand has 263 places, 1037 transitions, 15498 flow. Second operand 6 states and 98 transitions. [2025-03-14 01:08:34,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 894 transitions, 15739 flow [2025-03-14 01:08:36,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 894 transitions, 14868 flow, removed 231 selfloop flow, removed 11 redundant places. [2025-03-14 01:08:36,398 INFO L231 Difference]: Finished difference. Result has 245 places, 719 transitions, 10918 flow [2025-03-14 01:08:36,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=10773, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=715, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=691, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10918, PETRI_PLACES=245, PETRI_TRANSITIONS=719} [2025-03-14 01:08:36,399 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 210 predicate places. [2025-03-14 01:08:36,399 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 719 transitions, 10918 flow [2025-03-14 01:08:36,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.538461538461538) internal successors, (124), 13 states have internal predecessors, (124), 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-14 01:08:36,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:36,399 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:08:36,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-14 01:08:36,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-14 01:08:36,600 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:08:36,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:36,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1366238471, now seen corresponding path program 9 times [2025-03-14 01:08:36,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:36,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482168134] [2025-03-14 01:08:36,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:08:36,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:36,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-03-14 01:08:36,616 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 01:08:36,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:08:36,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:36,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:36,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:36,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482168134] [2025-03-14 01:08:36,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482168134] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:36,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483298046] [2025-03-14 01:08:36,662 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:08:36,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:36,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:36,665 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:08:36,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-14 01:08:36,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-03-14 01:08:36,732 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 01:08:36,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:08:36,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:36,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:08:36,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:08:36,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:36,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:08:36,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:36,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483298046] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:08:36,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:08:36,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-14 01:08:36,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892617581] [2025-03-14 01:08:36,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:08:36,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 01:08:36,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:36,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 01:08:36,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-14 01:08:36,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-14 01:08:36,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 719 transitions, 10918 flow. Second operand has 14 states, 14 states have (on average 9.428571428571429) internal successors, (132), 14 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:08:36,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:36,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-14 01:08:36,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:38,707 INFO L124 PetriNetUnfolderBase]: 8386/13240 cut-off events. [2025-03-14 01:08:38,707 INFO L125 PetriNetUnfolderBase]: For 180345/180933 co-relation queries the response was YES. [2025-03-14 01:08:38,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90566 conditions, 13240 events. 8386/13240 cut-off events. For 180345/180933 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 88350 event pairs, 3078 based on Foata normal form. 576/13771 useless extension candidates. Maximal degree in co-relation 90486. Up to 6944 conditions per place. [2025-03-14 01:08:38,913 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 603 selfloop transitions, 105 changer transitions 0/744 dead transitions. [2025-03-14 01:08:38,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 744 transitions, 12508 flow [2025-03-14 01:08:38,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:08:38,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:08:38,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2025-03-14 01:08:38,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49783549783549785 [2025-03-14 01:08:38,914 INFO L175 Difference]: Start difference. First operand has 245 places, 719 transitions, 10918 flow. Second operand 7 states and 115 transitions. [2025-03-14 01:08:38,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 744 transitions, 12508 flow [2025-03-14 01:08:39,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 744 transitions, 12404 flow, removed 42 selfloop flow, removed 5 redundant places. [2025-03-14 01:08:39,961 INFO L231 Difference]: Finished difference. Result has 246 places, 653 transitions, 10191 flow [2025-03-14 01:08:39,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=9875, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10191, PETRI_PLACES=246, PETRI_TRANSITIONS=653} [2025-03-14 01:08:39,962 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 211 predicate places. [2025-03-14 01:08:39,962 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 653 transitions, 10191 flow [2025-03-14 01:08:39,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.428571428571429) internal successors, (132), 14 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:08:39,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:39,962 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:08:39,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-14 01:08:40,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-14 01:08:40,163 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:08:40,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:40,164 INFO L85 PathProgramCache]: Analyzing trace with hash 952561733, now seen corresponding path program 10 times [2025-03-14 01:08:40,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:40,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981270867] [2025-03-14 01:08:40,164 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:08:40,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:40,167 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-14 01:08:40,169 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 29 statements. [2025-03-14 01:08:40,169 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 01:08:40,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:40,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:40,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:40,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981270867] [2025-03-14 01:08:40,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981270867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:40,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:40,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 01:08:40,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005953335] [2025-03-14 01:08:40,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:40,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 01:08:40,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:40,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 01:08:40,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-14 01:08:40,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-14 01:08:40,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 653 transitions, 10191 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-14 01:08:40,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:40,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-14 01:08:40,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:42,609 INFO L124 PetriNetUnfolderBase]: 11569/17461 cut-off events. [2025-03-14 01:08:42,609 INFO L125 PetriNetUnfolderBase]: For 214653/214893 co-relation queries the response was YES. [2025-03-14 01:08:42,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118206 conditions, 17461 events. 11569/17461 cut-off events. For 214653/214893 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 112090 event pairs, 1869 based on Foata normal form. 20/17480 useless extension candidates. Maximal degree in co-relation 118127. Up to 4889 conditions per place. [2025-03-14 01:08:42,827 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 732 selfloop transitions, 197 changer transitions 22/953 dead transitions. [2025-03-14 01:08:42,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 953 transitions, 16048 flow [2025-03-14 01:08:42,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:08:42,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:08:42,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2025-03-14 01:08:42,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4983164983164983 [2025-03-14 01:08:42,828 INFO L175 Difference]: Start difference. First operand has 246 places, 653 transitions, 10191 flow. Second operand 9 states and 148 transitions. [2025-03-14 01:08:42,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 953 transitions, 16048 flow [2025-03-14 01:08:44,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 953 transitions, 15872 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-03-14 01:08:44,430 INFO L231 Difference]: Finished difference. Result has 253 places, 685 transitions, 11297 flow [2025-03-14 01:08:44,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=10043, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11297, PETRI_PLACES=253, PETRI_TRANSITIONS=685} [2025-03-14 01:08:44,431 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 218 predicate places. [2025-03-14 01:08:44,431 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 685 transitions, 11297 flow [2025-03-14 01:08:44,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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-14 01:08:44,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:44,432 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:08:44,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:08:44,432 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:08:44,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:44,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1685171853, now seen corresponding path program 11 times [2025-03-14 01:08:44,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:44,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785179043] [2025-03-14 01:08:44,432 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:08:44,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:44,440 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-14 01:08:44,444 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 01:08:44,444 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:08:44,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:44,526 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-14 01:08:44,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:44,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785179043] [2025-03-14 01:08:44,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785179043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:44,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684057035] [2025-03-14 01:08:44,526 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:08:44,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:44,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:44,528 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:08:44,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-14 01:08:44,570 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-14 01:08:44,585 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 01:08:44,585 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:08:44,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:44,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-14 01:08:44,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:08:44,688 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-14 01:08:44,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:08:44,748 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-14 01:08:44,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684057035] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:08:44,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:08:44,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-14 01:08:44,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58660437] [2025-03-14 01:08:44,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:08:44,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 01:08:44,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:44,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 01:08:44,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-14 01:08:44,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-14 01:08:44,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 685 transitions, 11297 flow. Second operand has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 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-14 01:08:44,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:44,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-14 01:08:44,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:46,555 INFO L124 PetriNetUnfolderBase]: 7976/12543 cut-off events. [2025-03-14 01:08:46,556 INFO L125 PetriNetUnfolderBase]: For 173082/173751 co-relation queries the response was YES. [2025-03-14 01:08:46,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88921 conditions, 12543 events. 7976/12543 cut-off events. For 173082/173751 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 83441 event pairs, 2880 based on Foata normal form. 699/13144 useless extension candidates. Maximal degree in co-relation 88839. Up to 8094 conditions per place. [2025-03-14 01:08:46,794 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 320 selfloop transitions, 3 changer transitions 347/682 dead transitions. [2025-03-14 01:08:46,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 682 transitions, 12349 flow [2025-03-14 01:08:46,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:08:46,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:08:46,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2025-03-14 01:08:46,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-03-14 01:08:46,795 INFO L175 Difference]: Start difference. First operand has 253 places, 685 transitions, 11297 flow. Second operand 7 states and 110 transitions. [2025-03-14 01:08:46,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 682 transitions, 12349 flow [2025-03-14 01:08:48,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 682 transitions, 12235 flow, removed 56 selfloop flow, removed 2 redundant places. [2025-03-14 01:08:48,310 INFO L231 Difference]: Finished difference. Result has 257 places, 335 transitions, 4947 flow [2025-03-14 01:08:48,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=10004, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4947, PETRI_PLACES=257, PETRI_TRANSITIONS=335} [2025-03-14 01:08:48,310 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 222 predicate places. [2025-03-14 01:08:48,310 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 335 transitions, 4947 flow [2025-03-14 01:08:48,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 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-14 01:08:48,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:48,311 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:08:48,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-14 01:08:48,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-14 01:08:48,511 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:08:48,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:48,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1629024597, now seen corresponding path program 12 times [2025-03-14 01:08:48,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:48,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680833970] [2025-03-14 01:08:48,512 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:08:48,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:48,516 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-03-14 01:08:48,519 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:08:48,519 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-14 01:08:48,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:08:48,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:48,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680833970] [2025-03-14 01:08:48,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680833970] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:48,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681797866] [2025-03-14 01:08:48,583 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:08:48,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:48,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:48,585 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:08:48,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-14 01:08:48,625 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-03-14 01:08:48,638 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:08:48,639 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-14 01:08:48,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:48,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 01:08:48,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:08:48,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:08:48,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:08:48,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:08:48,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681797866] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:08:48,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:08:48,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2025-03-14 01:08:48,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093211784] [2025-03-14 01:08:48,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:08:48,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-14 01:08:48,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:48,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-14 01:08:48,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2025-03-14 01:08:48,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-14 01:08:48,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 335 transitions, 4947 flow. Second operand has 22 states, 22 states have (on average 6.681818181818182) internal successors, (147), 22 states have internal predecessors, (147), 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-14 01:08:48,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:48,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-14 01:08:48,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:54,503 INFO L124 PetriNetUnfolderBase]: 24424/34404 cut-off events. [2025-03-14 01:08:54,503 INFO L125 PetriNetUnfolderBase]: For 389900/389900 co-relation queries the response was YES. [2025-03-14 01:08:54,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230560 conditions, 34404 events. 24424/34404 cut-off events. For 389900/389900 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 202325 event pairs, 859 based on Foata normal form. 78/34482 useless extension candidates. Maximal degree in co-relation 230478. Up to 13238 conditions per place. [2025-03-14 01:08:54,854 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 1129 selfloop transitions, 513 changer transitions 0/1643 dead transitions. [2025-03-14 01:08:54,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 1643 transitions, 25557 flow [2025-03-14 01:08:54,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-14 01:08:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2025-03-14 01:08:54,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 836 transitions. [2025-03-14 01:08:54,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4293785310734463 [2025-03-14 01:08:54,856 INFO L175 Difference]: Start difference. First operand has 257 places, 335 transitions, 4947 flow. Second operand 59 states and 836 transitions. [2025-03-14 01:08:54,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 1643 transitions, 25557 flow [2025-03-14 01:08:57,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 1643 transitions, 23386 flow, removed 796 selfloop flow, removed 38 redundant places. [2025-03-14 01:08:57,055 INFO L231 Difference]: Finished difference. Result has 259 places, 739 transitions, 11784 flow [2025-03-14 01:08:57,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4265, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=11784, PETRI_PLACES=259, PETRI_TRANSITIONS=739} [2025-03-14 01:08:57,056 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 224 predicate places. [2025-03-14 01:08:57,056 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 739 transitions, 11784 flow [2025-03-14 01:08:57,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.681818181818182) internal successors, (147), 22 states have internal predecessors, (147), 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-14 01:08:57,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:57,056 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:08:57,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-14 01:08:57,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-14 01:08:57,257 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:08:57,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:57,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1544708555, now seen corresponding path program 13 times [2025-03-14 01:08:57,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:57,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22326898] [2025-03-14 01:08:57,258 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:08:57,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:57,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 01:08:57,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:08:57,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:57,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:57,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:57,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:57,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22326898] [2025-03-14 01:08:57,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22326898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:57,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962193388] [2025-03-14 01:08:57,342 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:08:57,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:57,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:57,344 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:08:57,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-14 01:08:57,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-14 01:08:57,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:08:57,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:57,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:57,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 01:08:57,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:08:57,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:57,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:08:57,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:08:57,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962193388] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:08:57,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:08:57,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-14 01:08:57,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456664058] [2025-03-14 01:08:57,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:08:57,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 01:08:57,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:57,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 01:08:57,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:08:57,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-14 01:08:57,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 739 transitions, 11784 flow. Second operand has 18 states, 18 states have (on average 7.722222222222222) internal successors, (139), 18 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-14 01:08:57,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:57,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-14 01:08:57,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:02,575 INFO L124 PetriNetUnfolderBase]: 20105/28984 cut-off events. [2025-03-14 01:09:02,576 INFO L125 PetriNetUnfolderBase]: For 482251/483626 co-relation queries the response was YES. [2025-03-14 01:09:02,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224015 conditions, 28984 events. 20105/28984 cut-off events. For 482251/483626 co-relation queries the response was YES. Maximal size of possible extension queue 1029. Compared 182481 event pairs, 2252 based on Foata normal form. 1180/30071 useless extension candidates. Maximal degree in co-relation 223925. Up to 12670 conditions per place. [2025-03-14 01:09:03,044 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 793 selfloop transitions, 277 changer transitions 0/1081 dead transitions. [2025-03-14 01:09:03,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 1081 transitions, 19428 flow [2025-03-14 01:09:03,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 01:09:03,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 01:09:03,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2025-03-14 01:09:03,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4125874125874126 [2025-03-14 01:09:03,045 INFO L175 Difference]: Start difference. First operand has 259 places, 739 transitions, 11784 flow. Second operand 13 states and 177 transitions. [2025-03-14 01:09:03,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 1081 transitions, 19428 flow [2025-03-14 01:09:06,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 1081 transitions, 18238 flow, removed 451 selfloop flow, removed 6 redundant places. [2025-03-14 01:09:06,773 INFO L231 Difference]: Finished difference. Result has 267 places, 758 transitions, 11963 flow [2025-03-14 01:09:06,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=10769, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=249, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=11963, PETRI_PLACES=267, PETRI_TRANSITIONS=758} [2025-03-14 01:09:06,773 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 232 predicate places. [2025-03-14 01:09:06,773 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 758 transitions, 11963 flow [2025-03-14 01:09:06,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.722222222222222) internal successors, (139), 18 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-14 01:09:06,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:06,774 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:09:06,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-14 01:09:06,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-14 01:09:06,975 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:09:06,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:06,975 INFO L85 PathProgramCache]: Analyzing trace with hash 29061389, now seen corresponding path program 14 times [2025-03-14 01:09:06,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:06,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063405130] [2025-03-14 01:09:06,975 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:09:06,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:06,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-14 01:09:06,983 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:09:06,986 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:09:06,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:07,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:09:07,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:07,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063405130] [2025-03-14 01:09:07,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063405130] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:09:07,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710279590] [2025-03-14 01:09:07,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:09:07,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:09:07,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:09:07,046 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:09:07,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-14 01:09:07,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-14 01:09:07,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:09:07,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:09:07,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:07,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 01:09:07,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:09:07,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:09:07,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:09:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:09:07,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710279590] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:09:07,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:09:07,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 19 [2025-03-14 01:09:07,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315458380] [2025-03-14 01:09:07,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:09:07,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 01:09:07,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:07,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 01:09:07,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-03-14 01:09:07,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-14 01:09:07,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 758 transitions, 11963 flow. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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-14 01:09:07,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:07,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-14 01:09:07,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:09:12,505 INFO L124 PetriNetUnfolderBase]: 23367/33559 cut-off events. [2025-03-14 01:09:12,506 INFO L125 PetriNetUnfolderBase]: For 570461/572102 co-relation queries the response was YES. [2025-03-14 01:09:13,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262021 conditions, 33559 events. 23367/33559 cut-off events. For 570461/572102 co-relation queries the response was YES. Maximal size of possible extension queue 1191. Compared 213880 event pairs, 2016 based on Foata normal form. 1381/34833 useless extension candidates. Maximal degree in co-relation 261931. Up to 15586 conditions per place. [2025-03-14 01:09:13,455 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 846 selfloop transitions, 312 changer transitions 0/1169 dead transitions. [2025-03-14 01:09:13,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 1169 transitions, 19989 flow [2025-03-14 01:09:13,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 01:09:13,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 01:09:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 191 transitions. [2025-03-14 01:09:13,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44522144522144524 [2025-03-14 01:09:13,456 INFO L175 Difference]: Start difference. First operand has 267 places, 758 transitions, 11963 flow. Second operand 13 states and 191 transitions. [2025-03-14 01:09:13,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 1169 transitions, 19989 flow [2025-03-14 01:09:17,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 1169 transitions, 19424 flow, removed 1 selfloop flow, removed 10 redundant places. [2025-03-14 01:09:17,090 INFO L231 Difference]: Finished difference. Result has 274 places, 803 transitions, 13345 flow [2025-03-14 01:09:17,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=11491, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=758, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=269, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=13345, PETRI_PLACES=274, PETRI_TRANSITIONS=803} [2025-03-14 01:09:17,091 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 239 predicate places. [2025-03-14 01:09:17,091 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 803 transitions, 13345 flow [2025-03-14 01:09:17,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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-14 01:09:17,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:09:17,091 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:09:17,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-14 01:09:17,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:09:17,292 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:09:17,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:09:17,292 INFO L85 PathProgramCache]: Analyzing trace with hash -296973861, now seen corresponding path program 15 times [2025-03-14 01:09:17,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:09:17,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121874053] [2025-03-14 01:09:17,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:09:17,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:09:17,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-03-14 01:09:17,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:09:17,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:09:17,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:17,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:09:17,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:09:17,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121874053] [2025-03-14 01:09:17,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121874053] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:09:17,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260047961] [2025-03-14 01:09:17,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:09:17,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:09:17,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:09:17,360 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:09:17,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-14 01:09:17,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-03-14 01:09:17,419 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-14 01:09:17,419 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:09:17,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:09:17,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 01:09:17,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:09:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:09:17,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:09:17,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:09:17,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260047961] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:09:17,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:09:17,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-14 01:09:17,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267596319] [2025-03-14 01:09:17,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:09:17,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 01:09:17,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:09:17,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 01:09:17,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-03-14 01:09:17,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-14 01:09:17,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 803 transitions, 13345 flow. Second operand has 20 states, 20 states have (on average 7.5) internal successors, (150), 20 states have internal predecessors, (150), 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-14 01:09:17,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:09:17,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-14 01:09:17,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand