./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-channel-sum.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 bc55f480d2dabcba35697f502078f181c178ae095f610e1cdbc5d03f14d18670 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:33:25,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:33:25,893 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:33:25,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:33:25,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:33:25,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:33:25,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:33:25,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:33:25,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:33:25,911 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:33:25,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:33:25,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:33:25,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:33:25,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:33:25,911 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:33:25,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:33:25,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:33:25,912 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:33:25,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:33:25,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:33:25,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:33:25,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:33:25,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:33:25,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:33:25,912 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:33:25,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:33:25,912 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:33:25,912 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:33:25,912 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:33:25,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:33:25,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:33:25,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:33:25,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:33:25,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:33:25,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:33:25,913 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:33:25,913 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:33:25,913 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:33:25,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:33:25,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:33:25,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:33:25,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:33:25,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:33:25,913 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 -> bc55f480d2dabcba35697f502078f181c178ae095f610e1cdbc5d03f14d18670 [2025-03-08 17:33:26,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:33:26,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:33:26,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:33:26,142 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:33:26,143 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:33:26,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c [2025-03-08 17:33:27,230 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d0ff19c7/e39e0980564846339a2f4a02a700524e/FLAG043fa6e42 [2025-03-08 17:33:27,478 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:33:27,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c [2025-03-08 17:33:27,485 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d0ff19c7/e39e0980564846339a2f4a02a700524e/FLAG043fa6e42 [2025-03-08 17:33:27,797 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d0ff19c7/e39e0980564846339a2f4a02a700524e [2025-03-08 17:33:27,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:33:27,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:33:27,801 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:33:27,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:33:27,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:33:27,805 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:33:27" (1/1) ... [2025-03-08 17:33:27,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a4544d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:27, skipping insertion in model container [2025-03-08 17:33:27,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:33:27" (1/1) ... [2025-03-08 17:33:27,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:33:27,953 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-channel-sum.wvr.c[2423,2436] [2025-03-08 17:33:27,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:33:27,970 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:33:27,988 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-channel-sum.wvr.c[2423,2436] [2025-03-08 17:33:27,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:33:28,007 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:33:28,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:28 WrapperNode [2025-03-08 17:33:28,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:33:28,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:33:28,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:33:28,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:33:28,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:28" (1/1) ... [2025-03-08 17:33:28,021 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:28" (1/1) ... [2025-03-08 17:33:28,039 INFO L138 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 128 [2025-03-08 17:33:28,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:33:28,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:33:28,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:33:28,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:33:28,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:28" (1/1) ... [2025-03-08 17:33:28,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:28" (1/1) ... [2025-03-08 17:33:28,052 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:28" (1/1) ... [2025-03-08 17:33:28,067 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-08 17:33:28,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:28" (1/1) ... [2025-03-08 17:33:28,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:28" (1/1) ... [2025-03-08 17:33:28,074 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:28" (1/1) ... [2025-03-08 17:33:28,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:28" (1/1) ... [2025-03-08 17:33:28,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:28" (1/1) ... [2025-03-08 17:33:28,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:28" (1/1) ... [2025-03-08 17:33:28,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:33:28,081 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:33:28,081 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:33:28,081 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:33:28,085 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:28" (1/1) ... [2025-03-08 17:33:28,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:33:28,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:33:28,110 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-08 17:33:28,112 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-08 17:33:28,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:33:28,134 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:33:28,135 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:33:28,135 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 17:33:28,135 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 17:33:28,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:33:28,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:33:28,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:33:28,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:33:28,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 17:33:28,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:33:28,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:33:28,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:33:28,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:33:28,137 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:33:28,208 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:33:28,209 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:33:28,399 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:33:28,399 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:33:28,585 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:33:28,586 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:33:28,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:33:28 BoogieIcfgContainer [2025-03-08 17:33:28,587 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:33:28,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:33:28,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:33:28,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:33:28,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:33:27" (1/3) ... [2025-03-08 17:33:28,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fb781d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:33:28, skipping insertion in model container [2025-03-08 17:33:28,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:28" (2/3) ... [2025-03-08 17:33:28,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fb781d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:33:28, skipping insertion in model container [2025-03-08 17:33:28,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:33:28" (3/3) ... [2025-03-08 17:33:28,595 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2025-03-08 17:33:28,606 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:33:28,608 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-channel-sum.wvr.c that has 3 procedures, 32 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 17:33:28,608 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:33:28,659 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 17:33:28,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 36 transitions, 86 flow [2025-03-08 17:33:28,719 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2025-03-08 17:33:28,722 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 17:33:28,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 34 events. 5/34 cut-off events. For 2/2 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/28 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-03-08 17:33:28,726 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 36 transitions, 86 flow [2025-03-08 17:33:28,729 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 33 transitions, 78 flow [2025-03-08 17:33:28,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:33:28,743 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;@25f994ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:33:28,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-08 17:33:28,753 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:33:28,754 INFO L124 PetriNetUnfolderBase]: 5/32 cut-off events. [2025-03-08 17:33:28,754 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 17:33:28,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:28,755 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-08 17:33:28,755 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:33:28,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:28,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2113939024, now seen corresponding path program 1 times [2025-03-08 17:33:28,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:28,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042974577] [2025-03-08 17:33:28,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:28,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:28,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 17:33:28,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 17:33:28,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:28,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:28,943 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-08 17:33:28,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:28,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042974577] [2025-03-08 17:33:28,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042974577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:28,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:28,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:33:28,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069898438] [2025-03-08 17:33:28,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:28,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 17:33:28,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:28,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 17:33:28,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:33:28,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-03-08 17:33:28,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 78 flow. Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-08 17:33:28,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:28,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-03-08 17:33:28,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:29,102 INFO L124 PetriNetUnfolderBase]: 203/343 cut-off events. [2025-03-08 17:33:29,102 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-08 17:33:29,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 343 events. 203/343 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1203 event pairs, 137 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 599. Up to 308 conditions per place. [2025-03-08 17:33:29,108 INFO L140 encePairwiseOnDemand]: 35/36 looper letters, 26 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2025-03-08 17:33:29,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 128 flow [2025-03-08 17:33:29,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 17:33:29,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-08 17:33:29,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 43 transitions. [2025-03-08 17:33:29,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2025-03-08 17:33:29,118 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 78 flow. Second operand 2 states and 43 transitions. [2025-03-08 17:33:29,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 128 flow [2025-03-08 17:33:29,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-08 17:33:29,122 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 68 flow [2025-03-08 17:33:29,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=32, PETRI_TRANSITIONS=32} [2025-03-08 17:33:29,130 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2025-03-08 17:33:29,130 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 68 flow [2025-03-08 17:33:29,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-08 17:33:29,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:29,131 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] [2025-03-08 17:33:29,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:33:29,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:33:29,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:29,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1953715752, now seen corresponding path program 1 times [2025-03-08 17:33:29,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:29,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197343314] [2025-03-08 17:33:29,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:29,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:29,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 17:33:29,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 17:33:29,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:29,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:29,271 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-08 17:33:29,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:29,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197343314] [2025-03-08 17:33:29,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197343314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:29,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:29,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:33:29,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115974940] [2025-03-08 17:33:29,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:29,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:33:29,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:29,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:33:29,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:33:29,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-03-08 17:33:29,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 68 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-08 17:33:29,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:29,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-03-08 17:33:29,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:29,384 INFO L124 PetriNetUnfolderBase]: 278/494 cut-off events. [2025-03-08 17:33:29,384 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-08 17:33:29,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 494 events. 278/494 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2100 event pairs, 108 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 967. Up to 252 conditions per place. [2025-03-08 17:33:29,388 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 40 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2025-03-08 17:33:29,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 50 transitions, 195 flow [2025-03-08 17:33:29,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:33:29,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:33:29,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-03-08 17:33:29,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-03-08 17:33:29,389 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 68 flow. Second operand 3 states and 69 transitions. [2025-03-08 17:33:29,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 50 transitions, 195 flow [2025-03-08 17:33:29,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 50 transitions, 195 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:33:29,391 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 80 flow [2025-03-08 17:33:29,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2025-03-08 17:33:29,392 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2025-03-08 17:33:29,392 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 80 flow [2025-03-08 17:33:29,392 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-08 17:33:29,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:29,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] [2025-03-08 17:33:29,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:33:29,393 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:33:29,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:29,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1734931323, now seen corresponding path program 1 times [2025-03-08 17:33:29,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:29,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823142964] [2025-03-08 17:33:29,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:29,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:29,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 17:33:29,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 17:33:29,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:29,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:29,469 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-08 17:33:29,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:29,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823142964] [2025-03-08 17:33:29,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823142964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:29,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:29,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:33:29,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820598092] [2025-03-08 17:33:29,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:29,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:33:29,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:29,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:33:29,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:33:29,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-03-08 17:33:29,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-08 17:33:29,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:29,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-03-08 17:33:29,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:29,591 INFO L124 PetriNetUnfolderBase]: 282/531 cut-off events. [2025-03-08 17:33:29,591 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-08 17:33:29,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 531 events. 282/531 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1962 event pairs, 114 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 1088. Up to 341 conditions per place. [2025-03-08 17:33:29,595 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 33 selfloop transitions, 6 changer transitions 1/46 dead transitions. [2025-03-08 17:33:29,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 190 flow [2025-03-08 17:33:29,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:33:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:33:29,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-03-08 17:33:29,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2025-03-08 17:33:29,597 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 80 flow. Second operand 3 states and 64 transitions. [2025-03-08 17:33:29,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 190 flow [2025-03-08 17:33:29,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:33:29,598 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 106 flow [2025-03-08 17:33:29,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2025-03-08 17:33:29,599 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2025-03-08 17:33:29,599 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 106 flow [2025-03-08 17:33:29,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-08 17:33:29,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:29,599 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, 1, 1] [2025-03-08 17:33:29,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:33:29,599 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:33:29,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:29,600 INFO L85 PathProgramCache]: Analyzing trace with hash 466982030, now seen corresponding path program 1 times [2025-03-08 17:33:29,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:29,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440836312] [2025-03-08 17:33:29,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:29,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:29,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 17:33:29,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 17:33:29,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:29,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:29,732 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-08 17:33:29,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:29,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440836312] [2025-03-08 17:33:29,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440836312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:29,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:29,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:33:29,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998956313] [2025-03-08 17:33:29,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:29,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:33:29,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:29,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:33:29,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:33:29,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-03-08 17:33:29,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-08 17:33:29,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:29,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-03-08 17:33:29,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:29,839 INFO L124 PetriNetUnfolderBase]: 262/514 cut-off events. [2025-03-08 17:33:29,840 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2025-03-08 17:33:29,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 514 events. 262/514 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1920 event pairs, 203 based on Foata normal form. 0/454 useless extension candidates. Maximal degree in co-relation 1180. Up to 471 conditions per place. [2025-03-08 17:33:29,843 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 27 selfloop transitions, 3 changer transitions 9/45 dead transitions. [2025-03-08 17:33:29,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 206 flow [2025-03-08 17:33:29,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:33:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:33:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-03-08 17:33:29,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2025-03-08 17:33:29,845 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 106 flow. Second operand 4 states and 69 transitions. [2025-03-08 17:33:29,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 206 flow [2025-03-08 17:33:29,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 200 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:33:29,849 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 118 flow [2025-03-08 17:33:29,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2025-03-08 17:33:29,850 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2025-03-08 17:33:29,850 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 118 flow [2025-03-08 17:33:29,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-08 17:33:29,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:29,851 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, 1, 1, 1] [2025-03-08 17:33:29,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:33:29,851 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:33:29,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:29,852 INFO L85 PathProgramCache]: Analyzing trace with hash 502003150, now seen corresponding path program 1 times [2025-03-08 17:33:29,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:29,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728994998] [2025-03-08 17:33:29,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:29,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:29,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 17:33:29,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 17:33:29,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:29,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:30,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:33:30,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:30,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728994998] [2025-03-08 17:33:30,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728994998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:33:30,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636556224] [2025-03-08 17:33:30,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:30,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:33:30,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:33:30,495 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-08 17:33:30,497 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-08 17:33:30,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 17:33:30,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 17:33:30,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:30,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:30,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 17:33:30,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:33:30,645 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 23 treesize of output 1 [2025-03-08 17:33:30,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:33:30,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:33:31,399 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 61 treesize of output 55 [2025-03-08 17:33:31,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:33:31,417 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 78 treesize of output 68 [2025-03-08 17:33:31,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:33:31,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636556224] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:33:31,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:33:31,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2025-03-08 17:33:31,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510219224] [2025-03-08 17:33:31,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:33:31,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 17:33:31,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:31,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 17:33:31,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2025-03-08 17:33:31,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-03-08 17:33:31,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 118 flow. Second operand has 27 states, 27 states have (on average 10.481481481481481) internal successors, (283), 27 states have internal predecessors, (283), 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-08 17:33:31,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:31,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-03-08 17:33:31,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:33,293 INFO L124 PetriNetUnfolderBase]: 1144/2125 cut-off events. [2025-03-08 17:33:33,293 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2025-03-08 17:33:33,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4851 conditions, 2125 events. 1144/2125 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12544 event pairs, 72 based on Foata normal form. 4/1910 useless extension candidates. Maximal degree in co-relation 4843. Up to 362 conditions per place. [2025-03-08 17:33:33,305 INFO L140 encePairwiseOnDemand]: 20/36 looper letters, 205 selfloop transitions, 103 changer transitions 72/386 dead transitions. [2025-03-08 17:33:33,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 386 transitions, 1863 flow [2025-03-08 17:33:33,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-08 17:33:33,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-03-08 17:33:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 777 transitions. [2025-03-08 17:33:33,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43166666666666664 [2025-03-08 17:33:33,309 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 118 flow. Second operand 50 states and 777 transitions. [2025-03-08 17:33:33,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 386 transitions, 1863 flow [2025-03-08 17:33:33,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 386 transitions, 1801 flow, removed 28 selfloop flow, removed 3 redundant places. [2025-03-08 17:33:33,315 INFO L231 Difference]: Finished difference. Result has 109 places, 155 transitions, 889 flow [2025-03-08 17:33:33,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=889, PETRI_PLACES=109, PETRI_TRANSITIONS=155} [2025-03-08 17:33:33,315 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 74 predicate places. [2025-03-08 17:33:33,316 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 155 transitions, 889 flow [2025-03-08 17:33:33,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 10.481481481481481) internal successors, (283), 27 states have internal predecessors, (283), 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-08 17:33:33,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:33,316 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, 1, 1, 1] [2025-03-08 17:33:33,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 17:33:33,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:33:33,520 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:33:33,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:33,521 INFO L85 PathProgramCache]: Analyzing trace with hash 993462157, now seen corresponding path program 1 times [2025-03-08 17:33:33,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:33,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637712922] [2025-03-08 17:33:33,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:33,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:33,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 17:33:33,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 17:33:33,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:33,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:33,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:33:33,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:33,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637712922] [2025-03-08 17:33:33,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637712922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:33,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:33,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:33:33,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879521743] [2025-03-08 17:33:33,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:33,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:33:33,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:33,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:33:33,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:33:33,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-03-08 17:33:33,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 155 transitions, 889 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-08 17:33:33,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:33,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-03-08 17:33:33,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:33,702 INFO L124 PetriNetUnfolderBase]: 734/1324 cut-off events. [2025-03-08 17:33:33,702 INFO L125 PetriNetUnfolderBase]: For 3438/3438 co-relation queries the response was YES. [2025-03-08 17:33:33,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4606 conditions, 1324 events. 734/1324 cut-off events. For 3438/3438 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6288 event pairs, 213 based on Foata normal form. 2/1303 useless extension candidates. Maximal degree in co-relation 4577. Up to 1155 conditions per place. [2025-03-08 17:33:33,713 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 122 selfloop transitions, 2 changer transitions 4/133 dead transitions. [2025-03-08 17:33:33,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 133 transitions, 1028 flow [2025-03-08 17:33:33,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:33:33,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:33:33,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-03-08 17:33:33,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2025-03-08 17:33:33,714 INFO L175 Difference]: Start difference. First operand has 109 places, 155 transitions, 889 flow. Second operand 3 states and 62 transitions. [2025-03-08 17:33:33,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 133 transitions, 1028 flow [2025-03-08 17:33:33,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 133 transitions, 899 flow, removed 42 selfloop flow, removed 14 redundant places. [2025-03-08 17:33:33,732 INFO L231 Difference]: Finished difference. Result has 78 places, 109 transitions, 531 flow [2025-03-08 17:33:33,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=531, PETRI_PLACES=78, PETRI_TRANSITIONS=109} [2025-03-08 17:33:33,733 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 43 predicate places. [2025-03-08 17:33:33,733 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 109 transitions, 531 flow [2025-03-08 17:33:33,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-08 17:33:33,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:33,733 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, 1, 1, 1] [2025-03-08 17:33:33,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:33:33,733 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:33:33,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:33,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1599495049, now seen corresponding path program 2 times [2025-03-08 17:33:33,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:33,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854259278] [2025-03-08 17:33:33,734 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:33:33,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:33,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-08 17:33:33,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 17:33:33,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:33:33,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:33,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:33:33,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:33,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854259278] [2025-03-08 17:33:33,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854259278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:33,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:33,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:33:33,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113231668] [2025-03-08 17:33:33,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:33,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:33:33,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:33,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:33:33,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:33:33,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-03-08 17:33:33,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 109 transitions, 531 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-08 17:33:33,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:33,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-03-08 17:33:33,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:33,988 INFO L124 PetriNetUnfolderBase]: 1223/2213 cut-off events. [2025-03-08 17:33:33,988 INFO L125 PetriNetUnfolderBase]: For 3028/3028 co-relation queries the response was YES. [2025-03-08 17:33:33,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7068 conditions, 2213 events. 1223/2213 cut-off events. For 3028/3028 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 10989 event pairs, 302 based on Foata normal form. 48/2210 useless extension candidates. Maximal degree in co-relation 7047. Up to 952 conditions per place. [2025-03-08 17:33:34,002 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 153 selfloop transitions, 54 changer transitions 1/215 dead transitions. [2025-03-08 17:33:34,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 215 transitions, 1473 flow [2025-03-08 17:33:34,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:33:34,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:33:34,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-03-08 17:33:34,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6180555555555556 [2025-03-08 17:33:34,003 INFO L175 Difference]: Start difference. First operand has 78 places, 109 transitions, 531 flow. Second operand 4 states and 89 transitions. [2025-03-08 17:33:34,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 215 transitions, 1473 flow [2025-03-08 17:33:34,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 215 transitions, 1471 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:33:34,015 INFO L231 Difference]: Finished difference. Result has 82 places, 154 transitions, 1055 flow [2025-03-08 17:33:34,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1055, PETRI_PLACES=82, PETRI_TRANSITIONS=154} [2025-03-08 17:33:34,017 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 47 predicate places. [2025-03-08 17:33:34,018 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 154 transitions, 1055 flow [2025-03-08 17:33:34,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-08 17:33:34,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:34,018 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:34,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:33:34,018 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:33:34,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:34,020 INFO L85 PathProgramCache]: Analyzing trace with hash 595619520, now seen corresponding path program 3 times [2025-03-08 17:33:34,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:34,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61549504] [2025-03-08 17:33:34,020 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:33:34,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:34,028 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 2 equivalence classes. [2025-03-08 17:33:34,047 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 17:33:34,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 17:33:34,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:34,151 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:33:34,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:34,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61549504] [2025-03-08 17:33:34,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61549504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:33:34,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110527531] [2025-03-08 17:33:34,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:33:34,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:33:34,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:33:34,153 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-08 17:33:34,155 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-08 17:33:34,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 2 equivalence classes. [2025-03-08 17:33:34,204 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 17:33:34,205 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 17:33:34,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:34,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 17:33:34,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:33:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:33:34,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:33:34,347 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:33:34,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110527531] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:33:34,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:33:34,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-08 17:33:34,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578157190] [2025-03-08 17:33:34,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:33:34,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 17:33:34,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:34,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 17:33:34,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-08 17:33:34,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-03-08 17:33:34,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 154 transitions, 1055 flow. Second operand has 15 states, 15 states have (on average 11.733333333333333) internal successors, (176), 15 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:33:34,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:34,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-03-08 17:33:34,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:34,619 INFO L124 PetriNetUnfolderBase]: 844/1559 cut-off events. [2025-03-08 17:33:34,619 INFO L125 PetriNetUnfolderBase]: For 3194/3194 co-relation queries the response was YES. [2025-03-08 17:33:34,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5577 conditions, 1559 events. 844/1559 cut-off events. For 3194/3194 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 6936 event pairs, 524 based on Foata normal form. 8/1554 useless extension candidates. Maximal degree in co-relation 5554. Up to 1378 conditions per place. [2025-03-08 17:33:34,628 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 92 selfloop transitions, 6 changer transitions 28/133 dead transitions. [2025-03-08 17:33:34,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 133 transitions, 1054 flow [2025-03-08 17:33:34,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 17:33:34,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 17:33:34,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2025-03-08 17:33:34,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3861111111111111 [2025-03-08 17:33:34,629 INFO L175 Difference]: Start difference. First operand has 82 places, 154 transitions, 1055 flow. Second operand 10 states and 139 transitions. [2025-03-08 17:33:34,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 133 transitions, 1054 flow [2025-03-08 17:33:34,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 133 transitions, 1022 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-03-08 17:33:34,637 INFO L231 Difference]: Finished difference. Result has 83 places, 105 transitions, 690 flow [2025-03-08 17:33:34,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=690, PETRI_PLACES=83, PETRI_TRANSITIONS=105} [2025-03-08 17:33:34,638 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 48 predicate places. [2025-03-08 17:33:34,638 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 105 transitions, 690 flow [2025-03-08 17:33:34,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.733333333333333) internal successors, (176), 15 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:33:34,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:34,638 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:33:34,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 17:33:34,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-08 17:33:34,839 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:33:34,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:34,840 INFO L85 PathProgramCache]: Analyzing trace with hash -874449234, now seen corresponding path program 4 times [2025-03-08 17:33:34,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:34,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466668800] [2025-03-08 17:33:34,840 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:33:34,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:34,847 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-03-08 17:33:34,859 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 17:33:34,859 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:33:34,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 17:33:34,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:34,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466668800] [2025-03-08 17:33:34,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466668800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:33:34,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:33:34,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:33:34,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112401967] [2025-03-08 17:33:34,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:33:34,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:33:34,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:34,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:33:34,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:33:34,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-03-08 17:33:34,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 105 transitions, 690 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-08 17:33:34,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:34,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-03-08 17:33:34,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:33:35,140 INFO L124 PetriNetUnfolderBase]: 1131/2069 cut-off events. [2025-03-08 17:33:35,140 INFO L125 PetriNetUnfolderBase]: For 3257/3257 co-relation queries the response was YES. [2025-03-08 17:33:35,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7028 conditions, 2069 events. 1131/2069 cut-off events. For 3257/3257 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 9684 event pairs, 269 based on Foata normal form. 112/2180 useless extension candidates. Maximal degree in co-relation 7007. Up to 1045 conditions per place. [2025-03-08 17:33:35,149 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 117 selfloop transitions, 4 changer transitions 2/128 dead transitions. [2025-03-08 17:33:35,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 128 transitions, 1060 flow [2025-03-08 17:33:35,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:33:35,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:33:35,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-03-08 17:33:35,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2025-03-08 17:33:35,150 INFO L175 Difference]: Start difference. First operand has 83 places, 105 transitions, 690 flow. Second operand 4 states and 71 transitions. [2025-03-08 17:33:35,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 128 transitions, 1060 flow [2025-03-08 17:33:35,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 128 transitions, 1026 flow, removed 11 selfloop flow, removed 11 redundant places. [2025-03-08 17:33:35,156 INFO L231 Difference]: Finished difference. Result has 67 places, 100 transitions, 649 flow [2025-03-08 17:33:35,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=649, PETRI_PLACES=67, PETRI_TRANSITIONS=100} [2025-03-08 17:33:35,157 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2025-03-08 17:33:35,157 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 100 transitions, 649 flow [2025-03-08 17:33:35,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-08 17:33:35,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:33:35,157 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 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, 1, 1, 1] [2025-03-08 17:33:35,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 17:33:35,158 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:33:35,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:33:35,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1944164993, now seen corresponding path program 1 times [2025-03-08 17:33:35,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:33:35,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295962738] [2025-03-08 17:33:35,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:35,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:33:35,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 17:33:35,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 17:33:35,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:35,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:36,267 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:33:36,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:33:36,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295962738] [2025-03-08 17:33:36,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295962738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:33:36,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258740106] [2025-03-08 17:33:36,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:33:36,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:33:36,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:33:36,270 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-08 17:33:36,272 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-08 17:33:36,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 17:33:36,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 17:33:36,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:33:36,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:33:36,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 17:33:36,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:33:37,044 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2025-03-08 17:33:37,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 21 [2025-03-08 17:33:37,073 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:33:37,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:33:37,524 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-03-08 17:33:37,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 60 [2025-03-08 17:33:38,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:33:38,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258740106] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:33:38,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:33:38,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 42 [2025-03-08 17:33:38,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99637780] [2025-03-08 17:33:38,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:33:38,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-08 17:33:38,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:33:38,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-08 17:33:38,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1578, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 17:33:38,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-03-08 17:33:38,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 100 transitions, 649 flow. Second operand has 43 states, 43 states have (on average 10.13953488372093) internal successors, (436), 43 states have internal predecessors, (436), 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-08 17:33:38,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:33:38,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-03-08 17:33:38,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:34:06,662 INFO L124 PetriNetUnfolderBase]: 13929/26396 cut-off events. [2025-03-08 17:34:06,662 INFO L125 PetriNetUnfolderBase]: For 39502/39502 co-relation queries the response was YES. [2025-03-08 17:34:06,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84685 conditions, 26396 events. 13929/26396 cut-off events. For 39502/39502 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 211486 event pairs, 899 based on Foata normal form. 221/24995 useless extension candidates. Maximal degree in co-relation 84667. Up to 6666 conditions per place. [2025-03-08 17:34:06,774 INFO L140 encePairwiseOnDemand]: 20/36 looper letters, 1419 selfloop transitions, 1438 changer transitions 394/3259 dead transitions. [2025-03-08 17:34:06,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 3259 transitions, 24501 flow [2025-03-08 17:34:06,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 347 states. [2025-03-08 17:34:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2025-03-08 17:34:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 5119 transitions. [2025-03-08 17:34:06,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40978226064681395 [2025-03-08 17:34:06,788 INFO L175 Difference]: Start difference. First operand has 67 places, 100 transitions, 649 flow. Second operand 347 states and 5119 transitions. [2025-03-08 17:34:06,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 3259 transitions, 24501 flow [2025-03-08 17:34:06,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 3259 transitions, 24469 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-03-08 17:34:06,854 INFO L231 Difference]: Finished difference. Result has 581 places, 1631 transitions, 16436 flow [2025-03-08 17:34:06,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=347, PETRI_FLOW=16436, PETRI_PLACES=581, PETRI_TRANSITIONS=1631} [2025-03-08 17:34:06,855 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 546 predicate places. [2025-03-08 17:34:06,855 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 1631 transitions, 16436 flow [2025-03-08 17:34:06,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 10.13953488372093) internal successors, (436), 43 states have internal predecessors, (436), 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-08 17:34:06,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:34:06,856 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 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, 1, 1, 1] [2025-03-08 17:34:06,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 17:34:07,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:34:07,058 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:34:07,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:34:07,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1170332065, now seen corresponding path program 2 times [2025-03-08 17:34:07,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:34:07,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705659608] [2025-03-08 17:34:07,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:34:07,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:34:07,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-08 17:34:07,080 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 17:34:07,080 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:34:07,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:34:07,725 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:34:07,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:34:07,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705659608] [2025-03-08 17:34:07,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705659608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:34:07,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878535814] [2025-03-08 17:34:07,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:34:07,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:34:07,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:34:07,730 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-08 17:34:07,732 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-08 17:34:07,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-08 17:34:07,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 17:34:07,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:34:07,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:34:07,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 17:34:07,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:34:07,880 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 23 treesize of output 1 [2025-03-08 17:34:08,226 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-03-08 17:34:08,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 15 [2025-03-08 17:34:08,253 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:34:08,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:34:08,891 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 116 treesize of output 104 [2025-03-08 17:34:08,916 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-03-08 17:34:08,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 196 [2025-03-08 17:34:09,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:34:09,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878535814] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:34:09,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:34:09,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 47 [2025-03-08 17:34:09,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954111123] [2025-03-08 17:34:09,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:34:09,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-08 17:34:09,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:34:09,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-08 17:34:09,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1968, Unknown=0, NotChecked=0, Total=2256 [2025-03-08 17:34:09,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-03-08 17:34:09,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 1631 transitions, 16436 flow. Second operand has 48 states, 48 states have (on average 9.958333333333334) internal successors, (478), 48 states have internal predecessors, (478), 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-08 17:34:09,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:34:09,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-03-08 17:34:09,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:34:21,948 INFO L124 PetriNetUnfolderBase]: 9237/17764 cut-off events. [2025-03-08 17:34:21,948 INFO L125 PetriNetUnfolderBase]: For 3018511/3018511 co-relation queries the response was YES. [2025-03-08 17:34:22,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162697 conditions, 17764 events. 9237/17764 cut-off events. For 3018511/3018511 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 124675 event pairs, 1032 based on Foata normal form. 115/17820 useless extension candidates. Maximal degree in co-relation 162510. Up to 5211 conditions per place. [2025-03-08 17:34:22,333 INFO L140 encePairwiseOnDemand]: 20/36 looper letters, 406 selfloop transitions, 1121 changer transitions 172/1707 dead transitions. [2025-03-08 17:34:22,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 1707 transitions, 23838 flow [2025-03-08 17:34:22,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2025-03-08 17:34:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2025-03-08 17:34:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 1691 transitions. [2025-03-08 17:34:22,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3613247863247863 [2025-03-08 17:34:22,339 INFO L175 Difference]: Start difference. First operand has 581 places, 1631 transitions, 16436 flow. Second operand 130 states and 1691 transitions. [2025-03-08 17:34:22,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 1707 transitions, 23838 flow [2025-03-08 17:34:25,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 1707 transitions, 18392 flow, removed 2685 selfloop flow, removed 91 redundant places. [2025-03-08 17:34:25,875 INFO L231 Difference]: Finished difference. Result has 507 places, 1267 transitions, 14695 flow [2025-03-08 17:34:25,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=6776, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=664, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=130, PETRI_FLOW=14695, PETRI_PLACES=507, PETRI_TRANSITIONS=1267} [2025-03-08 17:34:25,880 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 472 predicate places. [2025-03-08 17:34:25,880 INFO L471 AbstractCegarLoop]: Abstraction has has 507 places, 1267 transitions, 14695 flow [2025-03-08 17:34:25,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 9.958333333333334) internal successors, (478), 48 states have internal predecessors, (478), 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-08 17:34:25,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:34:25,880 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 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, 1, 1, 1] [2025-03-08 17:34:25,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 17:34:26,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:34:26,081 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:34:26,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:34:26,082 INFO L85 PathProgramCache]: Analyzing trace with hash 998291593, now seen corresponding path program 3 times [2025-03-08 17:34:26,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:34:26,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183982463] [2025-03-08 17:34:26,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:34:26,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:34:26,087 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-03-08 17:34:26,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 17:34:26,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 17:34:26,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:34:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:34:26,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:34:26,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183982463] [2025-03-08 17:34:26,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183982463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:34:26,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576230202] [2025-03-08 17:34:26,689 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:34:26,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:34:26,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:34:26,691 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-08 17:34:26,693 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-08 17:34:26,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 2 equivalence classes. [2025-03-08 17:34:26,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 17:34:26,748 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 17:34:26,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:34:26,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 17:34:26,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:34:26,818 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 23 treesize of output 1 [2025-03-08 17:34:27,255 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-03-08 17:34:27,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 15 [2025-03-08 17:34:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:34:27,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:34:27,889 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 116 treesize of output 104 [2025-03-08 17:34:27,922 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-03-08 17:34:27,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 232 treesize of output 204 [2025-03-08 17:34:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:34:28,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576230202] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:34:28,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:34:28,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 47 [2025-03-08 17:34:28,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438685752] [2025-03-08 17:34:28,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:34:28,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-08 17:34:28,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:34:28,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-08 17:34:28,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1973, Unknown=0, NotChecked=0, Total=2256 [2025-03-08 17:34:28,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-03-08 17:34:28,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 1267 transitions, 14695 flow. Second operand has 48 states, 48 states have (on average 9.958333333333334) internal successors, (478), 48 states have internal predecessors, (478), 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-08 17:34:28,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:34:28,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-03-08 17:34:28,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:34:38,760 INFO L124 PetriNetUnfolderBase]: 9218/17222 cut-off events. [2025-03-08 17:34:38,760 INFO L125 PetriNetUnfolderBase]: For 1070513/1070513 co-relation queries the response was YES. [2025-03-08 17:34:38,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126075 conditions, 17222 events. 9218/17222 cut-off events. For 1070513/1070513 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 116452 event pairs, 885 based on Foata normal form. 15/17185 useless extension candidates. Maximal degree in co-relation 125939. Up to 6167 conditions per place. [2025-03-08 17:34:38,965 INFO L140 encePairwiseOnDemand]: 20/36 looper letters, 501 selfloop transitions, 1240 changer transitions 89/1838 dead transitions. [2025-03-08 17:34:38,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 1838 transitions, 25247 flow [2025-03-08 17:34:38,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2025-03-08 17:34:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2025-03-08 17:34:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 1614 transitions. [2025-03-08 17:34:38,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3674863387978142 [2025-03-08 17:34:38,968 INFO L175 Difference]: Start difference. First operand has 507 places, 1267 transitions, 14695 flow. Second operand 122 states and 1614 transitions. [2025-03-08 17:34:38,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 1838 transitions, 25247 flow [2025-03-08 17:34:42,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 1838 transitions, 21717 flow, removed 1318 selfloop flow, removed 34 redundant places. [2025-03-08 17:34:42,390 INFO L231 Difference]: Finished difference. Result has 589 places, 1470 transitions, 17122 flow [2025-03-08 17:34:42,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=12239, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1038, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=122, PETRI_FLOW=17122, PETRI_PLACES=589, PETRI_TRANSITIONS=1470} [2025-03-08 17:34:42,391 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 554 predicate places. [2025-03-08 17:34:42,391 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 1470 transitions, 17122 flow [2025-03-08 17:34:42,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 9.958333333333334) internal successors, (478), 48 states have internal predecessors, (478), 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-08 17:34:42,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:34:42,392 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 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, 1, 1, 1] [2025-03-08 17:34:42,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 17:34:42,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 17:34:42,592 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:34:42,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:34:42,593 INFO L85 PathProgramCache]: Analyzing trace with hash -510458213, now seen corresponding path program 4 times [2025-03-08 17:34:42,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:34:42,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387415500] [2025-03-08 17:34:42,593 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:34:42,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:34:42,597 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-03-08 17:34:42,606 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 17:34:42,606 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:34:42,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:34:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:34:43,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:34:43,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387415500] [2025-03-08 17:34:43,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387415500] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:34:43,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733239791] [2025-03-08 17:34:43,079 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:34:43,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:34:43,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:34:43,081 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-08 17:34:43,082 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-08 17:34:43,153 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-03-08 17:34:43,171 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 17:34:43,171 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:34:43,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:34:43,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 17:34:43,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:34:43,223 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 23 treesize of output 1 [2025-03-08 17:34:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:34:43,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:34:43,960 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-08 17:34:43,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 17:34:43,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 237 treesize of output 208 [2025-03-08 17:34:44,437 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:34:44,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733239791] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:34:44,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:34:44,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 40 [2025-03-08 17:34:44,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61191072] [2025-03-08 17:34:44,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:34:44,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-08 17:34:44,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:34:44,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-08 17:34:44,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1343, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 17:34:44,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-03-08 17:34:44,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 1470 transitions, 17122 flow. Second operand has 41 states, 41 states have (on average 10.24390243902439) internal successors, (420), 41 states have internal predecessors, (420), 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-08 17:34:44,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:34:44,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-03-08 17:34:44,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:34:56,606 INFO L124 PetriNetUnfolderBase]: 13161/24558 cut-off events. [2025-03-08 17:34:56,607 INFO L125 PetriNetUnfolderBase]: For 1406481/1406481 co-relation queries the response was YES. [2025-03-08 17:34:56,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175279 conditions, 24558 events. 13161/24558 cut-off events. For 1406481/1406481 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 179763 event pairs, 955 based on Foata normal form. 63/24479 useless extension candidates. Maximal degree in co-relation 175146. Up to 10055 conditions per place. [2025-03-08 17:34:56,982 INFO L140 encePairwiseOnDemand]: 20/36 looper letters, 917 selfloop transitions, 1455 changer transitions 252/2632 dead transitions. [2025-03-08 17:34:56,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 2632 transitions, 36169 flow [2025-03-08 17:34:56,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2025-03-08 17:34:56,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2025-03-08 17:34:56,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 1653 transitions. [2025-03-08 17:34:56,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37636612021857924 [2025-03-08 17:34:56,985 INFO L175 Difference]: Start difference. First operand has 589 places, 1470 transitions, 17122 flow. Second operand 122 states and 1653 transitions. [2025-03-08 17:34:56,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 2632 transitions, 36169 flow