./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/unroll-cond-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/unroll-cond-3.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 9fb4c28a8a216c266c6ae14d377c8e26c68bb16bf7c2fe2809f039d12d6c4b55 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:11:56,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:11:56,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:11:56,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:11:56,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:11:56,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:11:56,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:11:56,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:11:56,456 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:11:56,456 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:11:56,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:11:56,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:11:56,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:11:56,457 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:11:56,457 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:11:56,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:11:56,457 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:11:56,457 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:11:56,457 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:11:56,457 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:11:56,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:11:56,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:11:56,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:11:56,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:11:56,458 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:11:56,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:11:56,458 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:11:56,458 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:11:56,458 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:11:56,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:11:56,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:11:56,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:11:56,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:11:56,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:11:56,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:11:56,459 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:11:56,459 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:11:56,459 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:11:56,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:11:56,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:11:56,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:11:56,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:11:56,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:11:56,460 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 -> 9fb4c28a8a216c266c6ae14d377c8e26c68bb16bf7c2fe2809f039d12d6c4b55 [2025-03-14 01:11:56,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:11:56,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:11:56,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:11:56,710 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:11:56,710 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:11:56,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-3.wvr.c [2025-03-14 01:11:57,839 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceef38e06/c28154759b50446babb2df5e9e0e3f63/FLAGc7315ad49 [2025-03-14 01:11:58,034 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:11:58,035 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-3.wvr.c [2025-03-14 01:11:58,057 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceef38e06/c28154759b50446babb2df5e9e0e3f63/FLAGc7315ad49 [2025-03-14 01:11:58,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceef38e06/c28154759b50446babb2df5e9e0e3f63 [2025-03-14 01:11:58,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:11:58,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:11:58,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:11:58,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:11:58,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:11:58,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:11:58" (1/1) ... [2025-03-14 01:11:58,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@583d8198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:58, skipping insertion in model container [2025-03-14 01:11:58,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:11:58" (1/1) ... [2025-03-14 01:11:58,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:11:58,552 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/unroll-cond-3.wvr.c[2667,2680] [2025-03-14 01:11:58,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:11:58,565 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:11:58,587 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/unroll-cond-3.wvr.c[2667,2680] [2025-03-14 01:11:58,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:11:58,598 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:11:58,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:58 WrapperNode [2025-03-14 01:11:58,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:11:58,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:11:58,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:11:58,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:11:58,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:58" (1/1) ... [2025-03-14 01:11:58,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:58" (1/1) ... [2025-03-14 01:11:58,620 INFO L138 Inliner]: procedures = 23, calls = 27, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 146 [2025-03-14 01:11:58,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:11:58,621 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:11:58,621 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:11:58,621 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:11:58,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:58" (1/1) ... [2025-03-14 01:11:58,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:58" (1/1) ... [2025-03-14 01:11:58,629 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:58" (1/1) ... [2025-03-14 01:11:58,637 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-14 01:11:58,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:58" (1/1) ... [2025-03-14 01:11:58,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:58" (1/1) ... [2025-03-14 01:11:58,641 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:58" (1/1) ... [2025-03-14 01:11:58,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:58" (1/1) ... [2025-03-14 01:11:58,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:58" (1/1) ... [2025-03-14 01:11:58,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:58" (1/1) ... [2025-03-14 01:11:58,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:11:58,645 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:11:58,645 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:11:58,645 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:11:58,646 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:58" (1/1) ... [2025-03-14 01:11:58,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:11:58,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:11:58,667 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:11:58,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:11:58,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:11:58,684 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:11:58,684 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:11:58,684 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:11:58,684 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:11:58,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:11:58,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 01:11:58,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 01:11:58,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 01:11:58,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:11:58,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:11:58,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:11:58,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 01:11:58,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 01:11:58,686 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:11:58,762 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:11:58,763 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:11:59,009 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:11:59,010 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:11:59,010 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:11:59,242 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:11:59,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:11:59 BoogieIcfgContainer [2025-03-14 01:11:59,243 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:11:59,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:11:59,245 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:11:59,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:11:59,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:11:58" (1/3) ... [2025-03-14 01:11:59,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10642884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:11:59, skipping insertion in model container [2025-03-14 01:11:59,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:11:58" (2/3) ... [2025-03-14 01:11:59,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10642884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:11:59, skipping insertion in model container [2025-03-14 01:11:59,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:11:59" (3/3) ... [2025-03-14 01:11:59,268 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-3.wvr.c [2025-03-14 01:11:59,280 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:11:59,281 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-3.wvr.c that has 3 procedures, 18 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-14 01:11:59,282 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:11:59,328 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:11:59,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 20 transitions, 54 flow [2025-03-14 01:11:59,378 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2025-03-14 01:11:59,382 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:11:59,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-03-14 01:11:59,386 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 20 transitions, 54 flow [2025-03-14 01:11:59,389 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 17 transitions, 46 flow [2025-03-14 01:11:59,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:11:59,406 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;@75fee008, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:11:59,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-14 01:11:59,416 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:11:59,416 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2025-03-14 01:11:59,416 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:11:59,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:59,418 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:59,418 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-14 01:11:59,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:59,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1369978944, now seen corresponding path program 1 times [2025-03-14 01:11:59,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:59,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391145025] [2025-03-14 01:11:59,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:11:59,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:59,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 01:11:59,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 01:11:59,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:11:59,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:11:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:11:59,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:11:59,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391145025] [2025-03-14 01:11:59,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391145025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:11:59,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:11:59,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:11:59,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594426349] [2025-03-14 01:11:59,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:11:59,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:11:59,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:11:59,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:11:59,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:11:59,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:11:59,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:11:59,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:11:59,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:11:59,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:11:59,847 INFO L124 PetriNetUnfolderBase]: 38/71 cut-off events. [2025-03-14 01:11:59,847 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-14 01:11:59,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 71 events. 38/71 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 121 event pairs, 22 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 120. Up to 70 conditions per place. [2025-03-14 01:11:59,849 INFO L140 encePairwiseOnDemand]: 17/20 looper letters, 15 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2025-03-14 01:11:59,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 82 flow [2025-03-14 01:11:59,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:11:59,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:11:59,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2025-03-14 01:11:59,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-14 01:11:59,860 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 27 transitions. [2025-03-14 01:11:59,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 82 flow [2025-03-14 01:11:59,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 74 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 01:11:59,866 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2025-03-14 01:11:59,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2025-03-14 01:11:59,870 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2025-03-14 01:11:59,871 INFO L471 AbstractCegarLoop]: Abstraction has has 20 places, 18 transitions, 50 flow [2025-03-14 01:11:59,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:11:59,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:11:59,872 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:11:59,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:11:59,873 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-14 01:11:59,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:11:59,874 INFO L85 PathProgramCache]: Analyzing trace with hash 73173435, now seen corresponding path program 1 times [2025-03-14 01:11:59,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:11:59,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106947960] [2025-03-14 01:11:59,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:11:59,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:11:59,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-14 01:11:59,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-14 01:11:59,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:11:59,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:00,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:12:00,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:00,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106947960] [2025-03-14 01:12:00,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106947960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:12:00,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:12:00,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:12:00,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107246068] [2025-03-14 01:12:00,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:12:00,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:12:00,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:00,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:12:00,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:12:00,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:00,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:00,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:00,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:00,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:00,306 INFO L124 PetriNetUnfolderBase]: 65/123 cut-off events. [2025-03-14 01:12:00,306 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:12:00,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 123 events. 65/123 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 324 event pairs, 22 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 248. Up to 71 conditions per place. [2025-03-14 01:12:00,309 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 32 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2025-03-14 01:12:00,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 38 transitions, 169 flow [2025-03-14 01:12:00,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:12:00,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:12:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2025-03-14 01:12:00,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-03-14 01:12:00,312 INFO L175 Difference]: Start difference. First operand has 20 places, 18 transitions, 50 flow. Second operand 5 states and 52 transitions. [2025-03-14 01:12:00,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 38 transitions, 169 flow [2025-03-14 01:12:00,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 38 transitions, 165 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 01:12:00,313 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 82 flow [2025-03-14 01:12:00,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2025-03-14 01:12:00,314 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2025-03-14 01:12:00,314 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 82 flow [2025-03-14 01:12:00,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:00,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:00,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:00,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:12:00,315 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-14 01:12:00,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:00,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1698989743, now seen corresponding path program 2 times [2025-03-14 01:12:00,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:00,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260588339] [2025-03-14 01:12:00,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:12:00,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:00,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-14 01:12:00,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-03-14 01:12:00,359 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:12:00,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:00,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:12:00,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:00,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260588339] [2025-03-14 01:12:00,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260588339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:12:00,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:12:00,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:12:00,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340909334] [2025-03-14 01:12:00,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:12:00,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:12:00,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:00,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:12:00,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:12:00,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:00,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:00,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:00,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:00,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:00,617 INFO L124 PetriNetUnfolderBase]: 100/190 cut-off events. [2025-03-14 01:12:00,617 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-03-14 01:12:00,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 190 events. 100/190 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 586 event pairs, 39 based on Foata normal form. 2/155 useless extension candidates. Maximal degree in co-relation 531. Up to 120 conditions per place. [2025-03-14 01:12:00,619 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 34 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2025-03-14 01:12:00,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 42 transitions, 242 flow [2025-03-14 01:12:00,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:12:00,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:12:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2025-03-14 01:12:00,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-03-14 01:12:00,620 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 82 flow. Second operand 5 states and 48 transitions. [2025-03-14 01:12:00,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 42 transitions, 242 flow [2025-03-14 01:12:00,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 42 transitions, 225 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-14 01:12:00,622 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 124 flow [2025-03-14 01:12:00,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2025-03-14 01:12:00,623 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 11 predicate places. [2025-03-14 01:12:00,623 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 124 flow [2025-03-14 01:12:00,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:00,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:00,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:00,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:12:00,623 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-14 01:12:00,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:00,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1597588025, now seen corresponding path program 3 times [2025-03-14 01:12:00,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:00,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632376808] [2025-03-14 01:12:00,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:12:00,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:00,637 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-03-14 01:12:00,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-03-14 01:12:00,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:12:00,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:12:00,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:00,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632376808] [2025-03-14 01:12:00,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632376808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:12:00,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:12:00,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:12:00,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583579911] [2025-03-14 01:12:00,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:12:00,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:12:00,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:00,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:12:00,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:12:00,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:00,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:00,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:00,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:00,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:00,897 INFO L124 PetriNetUnfolderBase]: 109/204 cut-off events. [2025-03-14 01:12:00,898 INFO L125 PetriNetUnfolderBase]: For 254/254 co-relation queries the response was YES. [2025-03-14 01:12:00,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 204 events. 109/204 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 639 event pairs, 39 based on Foata normal form. 3/182 useless extension candidates. Maximal degree in co-relation 689. Up to 111 conditions per place. [2025-03-14 01:12:00,901 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 33 selfloop transitions, 12 changer transitions 0/46 dead transitions. [2025-03-14 01:12:00,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 307 flow [2025-03-14 01:12:00,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:12:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:12:00,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2025-03-14 01:12:00,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-03-14 01:12:00,904 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 124 flow. Second operand 5 states and 52 transitions. [2025-03-14 01:12:00,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 307 flow [2025-03-14 01:12:00,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 283 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-03-14 01:12:00,906 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 203 flow [2025-03-14 01:12:00,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2025-03-14 01:12:00,908 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2025-03-14 01:12:00,908 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 203 flow [2025-03-14 01:12:00,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:00,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:00,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:00,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:12:00,908 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-14 01:12:00,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:00,909 INFO L85 PathProgramCache]: Analyzing trace with hash 497563987, now seen corresponding path program 4 times [2025-03-14 01:12:00,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:00,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108297851] [2025-03-14 01:12:00,909 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:12:00,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:00,916 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-03-14 01:12:00,930 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-14 01:12:00,931 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:12:00,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:01,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:12:01,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:01,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108297851] [2025-03-14 01:12:01,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108297851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:12:01,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:12:01,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:12:01,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79488236] [2025-03-14 01:12:01,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:12:01,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:12:01,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:01,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:12:01,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:12:01,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:01,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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-14 01:12:01,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:01,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:01,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:01,337 INFO L124 PetriNetUnfolderBase]: 106/201 cut-off events. [2025-03-14 01:12:01,338 INFO L125 PetriNetUnfolderBase]: For 483/483 co-relation queries the response was YES. [2025-03-14 01:12:01,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 201 events. 106/201 cut-off events. For 483/483 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 618 event pairs, 18 based on Foata normal form. 3/179 useless extension candidates. Maximal degree in co-relation 752. Up to 153 conditions per place. [2025-03-14 01:12:01,340 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 34 selfloop transitions, 18 changer transitions 0/53 dead transitions. [2025-03-14 01:12:01,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 437 flow [2025-03-14 01:12:01,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:12:01,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:12:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2025-03-14 01:12:01,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-03-14 01:12:01,341 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 203 flow. Second operand 6 states and 58 transitions. [2025-03-14 01:12:01,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 437 flow [2025-03-14 01:12:01,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 422 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-14 01:12:01,345 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 347 flow [2025-03-14 01:12:01,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=347, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2025-03-14 01:12:01,345 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 24 predicate places. [2025-03-14 01:12:01,345 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 347 flow [2025-03-14 01:12:01,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 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-14 01:12:01,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:01,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:01,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:12:01,346 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-14 01:12:01,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:01,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1492127885, now seen corresponding path program 5 times [2025-03-14 01:12:01,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:01,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545940378] [2025-03-14 01:12:01,349 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:12:01,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:01,358 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-14 01:12:01,371 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-14 01:12:01,371 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:12:01,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:01,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:12:01,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:01,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545940378] [2025-03-14 01:12:01,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545940378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:12:01,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:12:01,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:12:01,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74486561] [2025-03-14 01:12:01,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:12:01,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:12:01,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:01,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:12:01,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:12:01,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:01,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 347 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:01,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:01,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:01,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:01,556 INFO L124 PetriNetUnfolderBase]: 107/204 cut-off events. [2025-03-14 01:12:01,557 INFO L125 PetriNetUnfolderBase]: For 576/576 co-relation queries the response was YES. [2025-03-14 01:12:01,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 204 events. 107/204 cut-off events. For 576/576 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 665 event pairs, 30 based on Foata normal form. 2/181 useless extension candidates. Maximal degree in co-relation 857. Up to 113 conditions per place. [2025-03-14 01:12:01,559 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 38 selfloop transitions, 15 changer transitions 0/54 dead transitions. [2025-03-14 01:12:01,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 54 transitions, 491 flow [2025-03-14 01:12:01,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:12:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:12:01,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2025-03-14 01:12:01,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.51 [2025-03-14 01:12:01,561 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 347 flow. Second operand 5 states and 51 transitions. [2025-03-14 01:12:01,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 54 transitions, 491 flow [2025-03-14 01:12:01,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 453 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-03-14 01:12:01,568 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 351 flow [2025-03-14 01:12:01,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=351, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2025-03-14 01:12:01,569 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 29 predicate places. [2025-03-14 01:12:01,569 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 351 flow [2025-03-14 01:12:01,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:01,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:01,570 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:01,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:12:01,570 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-14 01:12:01,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:01,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1699584389, now seen corresponding path program 6 times [2025-03-14 01:12:01,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:01,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541565067] [2025-03-14 01:12:01,572 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:12:01,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:01,580 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-03-14 01:12:01,590 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-03-14 01:12:01,590 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 01:12:01,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:01,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:12:01,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:01,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541565067] [2025-03-14 01:12:01,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541565067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:12:01,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:12:01,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:12:01,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918971779] [2025-03-14 01:12:01,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:12:01,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:12:01,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:01,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:12:01,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:12:01,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:01,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 351 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:01,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:01,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:01,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:01,778 INFO L124 PetriNetUnfolderBase]: 106/197 cut-off events. [2025-03-14 01:12:01,778 INFO L125 PetriNetUnfolderBase]: For 680/680 co-relation queries the response was YES. [2025-03-14 01:12:01,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 866 conditions, 197 events. 106/197 cut-off events. For 680/680 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 602 event pairs, 41 based on Foata normal form. 2/174 useless extension candidates. Maximal degree in co-relation 836. Up to 154 conditions per place. [2025-03-14 01:12:01,780 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 32 selfloop transitions, 18 changer transitions 0/51 dead transitions. [2025-03-14 01:12:01,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 481 flow [2025-03-14 01:12:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:12:01,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:12:01,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-03-14 01:12:01,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47 [2025-03-14 01:12:01,781 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 351 flow. Second operand 5 states and 47 transitions. [2025-03-14 01:12:01,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 481 flow [2025-03-14 01:12:01,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 445 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-14 01:12:01,785 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 367 flow [2025-03-14 01:12:01,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=367, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2025-03-14 01:12:01,785 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 31 predicate places. [2025-03-14 01:12:01,786 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 367 flow [2025-03-14 01:12:01,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:01,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:01,786 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:01,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:12:01,786 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-14 01:12:01,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:01,787 INFO L85 PathProgramCache]: Analyzing trace with hash 389071707, now seen corresponding path program 1 times [2025-03-14 01:12:01,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:01,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548803971] [2025-03-14 01:12:01,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:01,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:01,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 01:12:01,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:12:01,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:01,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:01,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:12:01,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:01,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548803971] [2025-03-14 01:12:01,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548803971] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:12:01,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985938909] [2025-03-14 01:12:01,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:01,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:01,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:01,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:12:01,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:12:01,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 01:12:02,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:12:02,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:02,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:02,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-14 01:12:02,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:02,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-14 01:12:02,394 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-14 01:12:02,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 104 [2025-03-14 01:12:02,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:02,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:03,230 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 87 treesize of output 77 [2025-03-14 01:12:03,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:12:03,270 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 216 treesize of output 188 [2025-03-14 01:12:04,223 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 29 treesize of output 25 [2025-03-14 01:12:04,229 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:12:04,229 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 54 treesize of output 1 [2025-03-14 01:12:04,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:04,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985938909] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:12:04,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:12:04,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 19 [2025-03-14 01:12:04,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647362073] [2025-03-14 01:12:04,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:12:04,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 01:12:04,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:04,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 01:12:04,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-03-14 01:12:04,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:04,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 367 flow. Second operand has 19 states, 19 states have (on average 5.2105263157894735) internal successors, (99), 19 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:04,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:04,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:04,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:06,913 INFO L124 PetriNetUnfolderBase]: 373/725 cut-off events. [2025-03-14 01:12:06,914 INFO L125 PetriNetUnfolderBase]: For 2027/2027 co-relation queries the response was YES. [2025-03-14 01:12:06,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2848 conditions, 725 events. 373/725 cut-off events. For 2027/2027 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3526 event pairs, 15 based on Foata normal form. 12/618 useless extension candidates. Maximal degree in co-relation 2559. Up to 217 conditions per place. [2025-03-14 01:12:06,920 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 109 selfloop transitions, 63 changer transitions 62/235 dead transitions. [2025-03-14 01:12:06,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 235 transitions, 1846 flow [2025-03-14 01:12:06,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-14 01:12:06,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-14 01:12:06,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 303 transitions. [2025-03-14 01:12:06,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4590909090909091 [2025-03-14 01:12:06,924 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 367 flow. Second operand 33 states and 303 transitions. [2025-03-14 01:12:06,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 235 transitions, 1846 flow [2025-03-14 01:12:06,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 235 transitions, 1722 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-14 01:12:06,934 INFO L231 Difference]: Finished difference. Result has 95 places, 89 transitions, 881 flow [2025-03-14 01:12:06,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=881, PETRI_PLACES=95, PETRI_TRANSITIONS=89} [2025-03-14 01:12:06,935 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 74 predicate places. [2025-03-14 01:12:06,936 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 89 transitions, 881 flow [2025-03-14 01:12:06,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.2105263157894735) internal successors, (99), 19 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:06,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:06,936 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:06,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:12:07,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:07,137 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-14 01:12:07,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:07,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1078323635, now seen corresponding path program 2 times [2025-03-14 01:12:07,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:07,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392904217] [2025-03-14 01:12:07,138 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:12:07,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:07,152 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:12:07,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:12:07,171 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:12:07,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:12:07,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:07,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392904217] [2025-03-14 01:12:07,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392904217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:12:07,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250133279] [2025-03-14 01:12:07,310 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:12:07,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:07,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:07,312 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:12:07,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:12:07,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:12:07,372 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:12:07,372 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:12:07,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:07,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-14 01:12:07,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:12:07,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:08,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:12:08,058 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 158 treesize of output 127 [2025-03-14 01:12:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:12:14,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250133279] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:12:14,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:12:14,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2025-03-14 01:12:14,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263726995] [2025-03-14 01:12:14,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:12:14,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-14 01:12:14,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:14,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-14 01:12:14,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-03-14 01:12:14,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:14,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 89 transitions, 881 flow. Second operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:14,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:14,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:14,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:20,750 INFO L124 PetriNetUnfolderBase]: 362/789 cut-off events. [2025-03-14 01:12:20,750 INFO L125 PetriNetUnfolderBase]: For 3674/3674 co-relation queries the response was YES. [2025-03-14 01:12:20,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3782 conditions, 789 events. 362/789 cut-off events. For 3674/3674 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4420 event pairs, 30 based on Foata normal form. 11/778 useless extension candidates. Maximal degree in co-relation 3595. Up to 381 conditions per place. [2025-03-14 01:12:20,757 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 103 selfloop transitions, 77 changer transitions 14/195 dead transitions. [2025-03-14 01:12:20,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 195 transitions, 1936 flow [2025-03-14 01:12:20,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-14 01:12:20,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-14 01:12:20,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 198 transitions. [2025-03-14 01:12:20,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4125 [2025-03-14 01:12:20,758 INFO L175 Difference]: Start difference. First operand has 95 places, 89 transitions, 881 flow. Second operand 24 states and 198 transitions. [2025-03-14 01:12:20,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 195 transitions, 1936 flow [2025-03-14 01:12:20,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 195 transitions, 1657 flow, removed 127 selfloop flow, removed 7 redundant places. [2025-03-14 01:12:20,773 INFO L231 Difference]: Finished difference. Result has 117 places, 126 transitions, 1265 flow [2025-03-14 01:12:20,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1265, PETRI_PLACES=117, PETRI_TRANSITIONS=126} [2025-03-14 01:12:20,774 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 96 predicate places. [2025-03-14 01:12:20,774 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 126 transitions, 1265 flow [2025-03-14 01:12:20,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:20,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:20,775 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:20,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 01:12:20,979 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,SelfDestructingSolverStorable8 [2025-03-14 01:12:20,979 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-14 01:12:20,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:20,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1183783775, now seen corresponding path program 3 times [2025-03-14 01:12:20,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:20,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153652024] [2025-03-14 01:12:20,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:12:20,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:20,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:12:21,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:12:21,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:12:21,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:21,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:12:21,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:21,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153652024] [2025-03-14 01:12:21,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153652024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:12:21,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275006452] [2025-03-14 01:12:21,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:12:21,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:21,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:21,096 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:12:21,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 01:12:21,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:12:21,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:12:21,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:12:21,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:21,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-14 01:12:21,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:21,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:12:21,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 109 [2025-03-14 01:12:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:12:21,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:22,084 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-14 01:12:22,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-03-14 01:12:22,103 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 11 treesize of output 3 [2025-03-14 01:12:22,118 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-14 01:12:22,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-03-14 01:12:22,158 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-03-14 01:12:22,158 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 42 [2025-03-14 01:12:22,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:12:22,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275006452] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:12:22,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:12:22,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2025-03-14 01:12:22,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292478537] [2025-03-14 01:12:22,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:12:22,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-14 01:12:22,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:22,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-14 01:12:22,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-03-14 01:12:22,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:22,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 126 transitions, 1265 flow. Second operand has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:22,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:22,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:22,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:22,802 INFO L124 PetriNetUnfolderBase]: 351/754 cut-off events. [2025-03-14 01:12:22,802 INFO L125 PetriNetUnfolderBase]: For 3948/3948 co-relation queries the response was YES. [2025-03-14 01:12:22,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3847 conditions, 754 events. 351/754 cut-off events. For 3948/3948 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4077 event pairs, 30 based on Foata normal form. 7/761 useless extension candidates. Maximal degree in co-relation 3636. Up to 428 conditions per place. [2025-03-14 01:12:22,807 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 89 selfloop transitions, 69 changer transitions 12/171 dead transitions. [2025-03-14 01:12:22,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 171 transitions, 1826 flow [2025-03-14 01:12:22,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 01:12:22,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 01:12:22,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 141 transitions. [2025-03-14 01:12:22,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4147058823529412 [2025-03-14 01:12:22,808 INFO L175 Difference]: Start difference. First operand has 117 places, 126 transitions, 1265 flow. Second operand 17 states and 141 transitions. [2025-03-14 01:12:22,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 171 transitions, 1826 flow [2025-03-14 01:12:22,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 171 transitions, 1684 flow, removed 48 selfloop flow, removed 7 redundant places. [2025-03-14 01:12:22,826 INFO L231 Difference]: Finished difference. Result has 129 places, 129 transitions, 1337 flow [2025-03-14 01:12:22,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1337, PETRI_PLACES=129, PETRI_TRANSITIONS=129} [2025-03-14 01:12:22,828 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 108 predicate places. [2025-03-14 01:12:22,828 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 129 transitions, 1337 flow [2025-03-14 01:12:22,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:22,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:22,829 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:22,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-14 01:12:23,029 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-14 01:12:23,030 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-14 01:12:23,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:23,030 INFO L85 PathProgramCache]: Analyzing trace with hash -534559931, now seen corresponding path program 4 times [2025-03-14 01:12:23,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:23,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943468906] [2025-03-14 01:12:23,031 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:12:23,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:23,037 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:12:23,048 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:12:23,048 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:12:23,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:12:23,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:23,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943468906] [2025-03-14 01:12:23,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943468906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:12:23,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804778601] [2025-03-14 01:12:23,150 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:12:23,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:23,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:23,152 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:12:23,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 01:12:23,193 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:12:23,207 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:12:23,207 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 01:12:23,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:23,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-14 01:12:23,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:23,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-14 01:12:23,451 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 33 treesize of output 21 [2025-03-14 01:12:23,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:23,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:24,361 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 33 treesize of output 29 [2025-03-14 01:12:24,369 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-14 01:12:24,369 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 62 treesize of output 41 [2025-03-14 01:12:24,386 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 87 treesize of output 77 [2025-03-14 01:12:24,415 INFO L349 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2025-03-14 01:12:24,415 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 216 treesize of output 164 [2025-03-14 01:12:24,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:24,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804778601] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:12:24,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:12:24,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 19 [2025-03-14 01:12:24,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077843894] [2025-03-14 01:12:24,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:12:24,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 01:12:24,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:24,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 01:12:24,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-03-14 01:12:24,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:24,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 129 transitions, 1337 flow. Second operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 19 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:24,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:24,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:24,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:26,148 INFO L124 PetriNetUnfolderBase]: 409/940 cut-off events. [2025-03-14 01:12:26,148 INFO L125 PetriNetUnfolderBase]: For 5224/5224 co-relation queries the response was YES. [2025-03-14 01:12:26,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4777 conditions, 940 events. 409/940 cut-off events. For 5224/5224 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5737 event pairs, 7 based on Foata normal form. 9/949 useless extension candidates. Maximal degree in co-relation 4592. Up to 314 conditions per place. [2025-03-14 01:12:26,154 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 113 selfloop transitions, 119 changer transitions 42/275 dead transitions. [2025-03-14 01:12:26,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 275 transitions, 2856 flow [2025-03-14 01:12:26,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-14 01:12:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-14 01:12:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 285 transitions. [2025-03-14 01:12:26,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41911764705882354 [2025-03-14 01:12:26,156 INFO L175 Difference]: Start difference. First operand has 129 places, 129 transitions, 1337 flow. Second operand 34 states and 285 transitions. [2025-03-14 01:12:26,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 275 transitions, 2856 flow [2025-03-14 01:12:26,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 275 transitions, 2685 flow, removed 18 selfloop flow, removed 13 redundant places. [2025-03-14 01:12:26,175 INFO L231 Difference]: Finished difference. Result has 155 places, 169 transitions, 2004 flow [2025-03-14 01:12:26,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2004, PETRI_PLACES=155, PETRI_TRANSITIONS=169} [2025-03-14 01:12:26,177 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 134 predicate places. [2025-03-14 01:12:26,178 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 169 transitions, 2004 flow [2025-03-14 01:12:26,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 19 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:26,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:26,178 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:26,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 01:12:26,382 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-14 01:12:26,382 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-14 01:12:26,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:26,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1681113537, now seen corresponding path program 5 times [2025-03-14 01:12:26,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:26,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736611004] [2025-03-14 01:12:26,383 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:12:26,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:26,387 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:12:26,400 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:12:26,400 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:12:26,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:12:26,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:26,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736611004] [2025-03-14 01:12:26,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736611004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:12:26,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793258518] [2025-03-14 01:12:26,501 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:12:26,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:26,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:26,503 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:12:26,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 01:12:26,549 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:12:26,564 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:12:26,564 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:12:26,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:26,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-14 01:12:26,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:26,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-14 01:12:26,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:12:26,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 46 [2025-03-14 01:12:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:26,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:27,024 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 33 treesize of output 29 [2025-03-14 01:12:27,031 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-14 01:12:27,031 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 62 treesize of output 41 [2025-03-14 01:12:27,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:27,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793258518] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:12:27,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:12:27,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 20 [2025-03-14 01:12:27,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860947000] [2025-03-14 01:12:27,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:12:27,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 01:12:27,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:27,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 01:12:27,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-03-14 01:12:27,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:27,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 169 transitions, 2004 flow. Second operand has 20 states, 20 states have (on average 5.1) internal successors, (102), 20 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:27,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:27,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:27,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:27,669 INFO L124 PetriNetUnfolderBase]: 373/853 cut-off events. [2025-03-14 01:12:27,669 INFO L125 PetriNetUnfolderBase]: For 5711/5711 co-relation queries the response was YES. [2025-03-14 01:12:27,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4846 conditions, 853 events. 373/853 cut-off events. For 5711/5711 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5035 event pairs, 6 based on Foata normal form. 6/858 useless extension candidates. Maximal degree in co-relation 4740. Up to 319 conditions per place. [2025-03-14 01:12:27,677 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 112 selfloop transitions, 114 changer transitions 4/231 dead transitions. [2025-03-14 01:12:27,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 231 transitions, 2908 flow [2025-03-14 01:12:27,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 01:12:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 01:12:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 134 transitions. [2025-03-14 01:12:27,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3941176470588235 [2025-03-14 01:12:27,679 INFO L175 Difference]: Start difference. First operand has 155 places, 169 transitions, 2004 flow. Second operand 17 states and 134 transitions. [2025-03-14 01:12:27,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 231 transitions, 2908 flow [2025-03-14 01:12:27,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 231 transitions, 2562 flow, removed 124 selfloop flow, removed 19 redundant places. [2025-03-14 01:12:27,707 INFO L231 Difference]: Finished difference. Result has 150 places, 186 transitions, 2206 flow [2025-03-14 01:12:27,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1723, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2206, PETRI_PLACES=150, PETRI_TRANSITIONS=186} [2025-03-14 01:12:27,709 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 129 predicate places. [2025-03-14 01:12:27,709 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 186 transitions, 2206 flow [2025-03-14 01:12:27,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.1) internal successors, (102), 20 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:27,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:27,710 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:27,716 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-14 01:12:27,910 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-14 01:12:27,911 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-14 01:12:27,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:27,911 INFO L85 PathProgramCache]: Analyzing trace with hash -982536167, now seen corresponding path program 6 times [2025-03-14 01:12:27,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:27,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784021799] [2025-03-14 01:12:27,911 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:12:27,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:27,916 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:12:27,931 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:12:27,931 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-14 01:12:27,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:12:28,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:28,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784021799] [2025-03-14 01:12:28,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784021799] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:12:28,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149271008] [2025-03-14 01:12:28,040 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:12:28,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:28,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:28,042 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:12:28,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-14 01:12:28,083 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-03-14 01:12:28,102 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:12:28,103 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-14 01:12:28,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:28,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-14 01:12:28,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:28,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-14 01:12:28,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:28,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:12:29,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149271008] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:12:29,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:12:29,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 18 [2025-03-14 01:12:29,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659588119] [2025-03-14 01:12:29,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:12:29,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 01:12:29,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:29,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 01:12:29,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:12:29,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:29,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 186 transitions, 2206 flow. Second operand has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:29,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:29,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:29,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:31,758 INFO L124 PetriNetUnfolderBase]: 487/1030 cut-off events. [2025-03-14 01:12:31,758 INFO L125 PetriNetUnfolderBase]: For 5891/5891 co-relation queries the response was YES. [2025-03-14 01:12:31,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5790 conditions, 1030 events. 487/1030 cut-off events. For 5891/5891 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6059 event pairs, 20 based on Foata normal form. 11/1040 useless extension candidates. Maximal degree in co-relation 5614. Up to 419 conditions per place. [2025-03-14 01:12:31,766 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 141 selfloop transitions, 135 changer transitions 16/293 dead transitions. [2025-03-14 01:12:31,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 293 transitions, 3596 flow [2025-03-14 01:12:31,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-14 01:12:31,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-14 01:12:31,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 235 transitions. [2025-03-14 01:12:31,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39166666666666666 [2025-03-14 01:12:31,768 INFO L175 Difference]: Start difference. First operand has 150 places, 186 transitions, 2206 flow. Second operand 30 states and 235 transitions. [2025-03-14 01:12:31,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 293 transitions, 3596 flow [2025-03-14 01:12:31,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 293 transitions, 3359 flow, removed 62 selfloop flow, removed 10 redundant places. [2025-03-14 01:12:31,797 INFO L231 Difference]: Finished difference. Result has 178 places, 222 transitions, 2856 flow [2025-03-14 01:12:31,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1975, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2856, PETRI_PLACES=178, PETRI_TRANSITIONS=222} [2025-03-14 01:12:31,798 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 157 predicate places. [2025-03-14 01:12:31,798 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 222 transitions, 2856 flow [2025-03-14 01:12:31,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:31,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:31,798 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:31,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-14 01:12:31,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:31,999 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:12:31,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:31,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1699547563, now seen corresponding path program 7 times [2025-03-14 01:12:32,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:32,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079054769] [2025-03-14 01:12:32,000 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:12:32,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:32,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 01:12:32,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:12:32,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:32,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:12:32,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:32,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079054769] [2025-03-14 01:12:32,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079054769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:12:32,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813177907] [2025-03-14 01:12:32,112 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:12:32,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:32,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:32,114 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:12:32,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-14 01:12:32,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-14 01:12:32,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-14 01:12:32,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:32,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:32,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-14 01:12:32,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:32,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-14 01:12:32,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:12:32,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2025-03-14 01:12:32,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:32,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:32,801 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 33 treesize of output 29 [2025-03-14 01:12:32,806 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-14 01:12:32,806 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 62 treesize of output 41 [2025-03-14 01:12:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:12:32,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813177907] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:12:32,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:12:32,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 20 [2025-03-14 01:12:32,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596715364] [2025-03-14 01:12:32,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:12:32,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 01:12:32,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:12:32,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 01:12:32,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2025-03-14 01:12:32,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:12:32,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 222 transitions, 2856 flow. Second operand has 20 states, 20 states have (on average 5.1) internal successors, (102), 20 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:32,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:12:32,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:12:32,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:12:33,461 INFO L124 PetriNetUnfolderBase]: 479/1012 cut-off events. [2025-03-14 01:12:33,462 INFO L125 PetriNetUnfolderBase]: For 5901/5901 co-relation queries the response was YES. [2025-03-14 01:12:33,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6047 conditions, 1012 events. 479/1012 cut-off events. For 5901/5901 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5883 event pairs, 6 based on Foata normal form. 6/1017 useless extension candidates. Maximal degree in co-relation 5857. Up to 559 conditions per place. [2025-03-14 01:12:33,470 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 140 selfloop transitions, 122 changer transitions 4/267 dead transitions. [2025-03-14 01:12:33,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 267 transitions, 3584 flow [2025-03-14 01:12:33,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 01:12:33,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 01:12:33,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 149 transitions. [2025-03-14 01:12:33,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39210526315789473 [2025-03-14 01:12:33,471 INFO L175 Difference]: Start difference. First operand has 178 places, 222 transitions, 2856 flow. Second operand 19 states and 149 transitions. [2025-03-14 01:12:33,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 267 transitions, 3584 flow [2025-03-14 01:12:33,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 267 transitions, 3297 flow, removed 95 selfloop flow, removed 12 redundant places. [2025-03-14 01:12:33,508 INFO L231 Difference]: Finished difference. Result has 185 places, 226 transitions, 2922 flow [2025-03-14 01:12:33,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2552, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2922, PETRI_PLACES=185, PETRI_TRANSITIONS=226} [2025-03-14 01:12:33,508 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 164 predicate places. [2025-03-14 01:12:33,508 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 226 transitions, 2922 flow [2025-03-14 01:12:33,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.1) internal successors, (102), 20 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:12:33,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:12:33,508 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:12:33,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-14 01:12:33,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:33,709 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:12:33,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:12:33,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1807278255, now seen corresponding path program 1 times [2025-03-14 01:12:33,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:12:33,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532861537] [2025-03-14 01:12:33,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:33,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:12:33,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-14 01:12:33,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 01:12:33,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:33,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:12:33,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:12:33,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532861537] [2025-03-14 01:12:33,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532861537] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:12:33,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040945361] [2025-03-14 01:12:33,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:12:33,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:12:33,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:12:33,884 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:12:33,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-14 01:12:33,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-14 01:12:33,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 01:12:33,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:12:33,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:12:33,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-14 01:12:33,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:12:33,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-14 01:12:34,162 INFO L349 Elim1Store]: treesize reduction 74, result has 14.9 percent of original size [2025-03-14 01:12:34,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 203 treesize of output 146 [2025-03-14 01:12:34,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:12:34,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:12:34,587 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 348 treesize of output 306 [2025-03-14 01:12:34,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:12:34,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 13 new quantified variables, introduced 28 case distinctions, treesize of input 2023 treesize of output 1237 [2025-03-14 01:13:26,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:13:26,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040945361] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:13:26,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:13:26,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 18 [2025-03-14 01:13:26,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980680460] [2025-03-14 01:13:26,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:13:26,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 01:13:26,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:13:26,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 01:13:26,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:13:26,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:13:26,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 226 transitions, 2922 flow. Second operand has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:26,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:13:26,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:13:26,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:13:27,491 INFO L124 PetriNetUnfolderBase]: 490/1028 cut-off events. [2025-03-14 01:13:27,491 INFO L125 PetriNetUnfolderBase]: For 6856/6856 co-relation queries the response was YES. [2025-03-14 01:13:27,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6242 conditions, 1028 events. 490/1028 cut-off events. For 6856/6856 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5981 event pairs, 15 based on Foata normal form. 16/1038 useless extension candidates. Maximal degree in co-relation 6062. Up to 527 conditions per place. [2025-03-14 01:13:27,504 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 124 selfloop transitions, 98 changer transitions 62/285 dead transitions. [2025-03-14 01:13:27,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 285 transitions, 3880 flow [2025-03-14 01:13:27,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-14 01:13:27,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-14 01:13:27,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 190 transitions. [2025-03-14 01:13:27,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2025-03-14 01:13:27,505 INFO L175 Difference]: Start difference. First operand has 185 places, 226 transitions, 2922 flow. Second operand 24 states and 190 transitions. [2025-03-14 01:13:27,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 285 transitions, 3880 flow [2025-03-14 01:13:27,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 285 transitions, 3718 flow, removed 15 selfloop flow, removed 15 redundant places. [2025-03-14 01:13:27,541 INFO L231 Difference]: Finished difference. Result has 196 places, 184 transitions, 2474 flow [2025-03-14 01:13:27,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2763, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2474, PETRI_PLACES=196, PETRI_TRANSITIONS=184} [2025-03-14 01:13:27,542 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 175 predicate places. [2025-03-14 01:13:27,542 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 184 transitions, 2474 flow [2025-03-14 01:13:27,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:27,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:13:27,543 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:13:27,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-14 01:13:27,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-14 01:13:27,744 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:13:27,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:13:27,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1025370974, now seen corresponding path program 1 times [2025-03-14 01:13:27,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:13:27,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098227748] [2025-03-14 01:13:27,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:13:27,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:13:27,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-14 01:13:27,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 01:13:27,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:13:27,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:27,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:13:27,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:13:27,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098227748] [2025-03-14 01:13:27,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098227748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:13:27,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276858808] [2025-03-14 01:13:27,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:13:27,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:13:27,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:13:27,873 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:13:27,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-14 01:13:27,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-14 01:13:27,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 01:13:27,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:13:27,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:27,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-14 01:13:27,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:13:27,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:13:27,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:13:28,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:13:28,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276858808] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:13:28,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:13:28,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-14 01:13:28,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351347117] [2025-03-14 01:13:28,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:13:28,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 01:13:28,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:13:28,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 01:13:28,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-14 01:13:28,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:13:28,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 184 transitions, 2474 flow. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:28,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:13:28,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:13:28,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:13:28,552 INFO L124 PetriNetUnfolderBase]: 426/874 cut-off events. [2025-03-14 01:13:28,552 INFO L125 PetriNetUnfolderBase]: For 6343/6343 co-relation queries the response was YES. [2025-03-14 01:13:28,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5563 conditions, 874 events. 426/874 cut-off events. For 6343/6343 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4821 event pairs, 52 based on Foata normal form. 12/882 useless extension candidates. Maximal degree in co-relation 5506. Up to 217 conditions per place. [2025-03-14 01:13:28,560 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 143 selfloop transitions, 104 changer transitions 0/248 dead transitions. [2025-03-14 01:13:28,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 248 transitions, 3477 flow [2025-03-14 01:13:28,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 01:13:28,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 01:13:28,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 133 transitions. [2025-03-14 01:13:28,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.415625 [2025-03-14 01:13:28,564 INFO L175 Difference]: Start difference. First operand has 196 places, 184 transitions, 2474 flow. Second operand 16 states and 133 transitions. [2025-03-14 01:13:28,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 248 transitions, 3477 flow [2025-03-14 01:13:28,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 248 transitions, 3241 flow, removed 52 selfloop flow, removed 21 redundant places. [2025-03-14 01:13:28,599 INFO L231 Difference]: Finished difference. Result has 173 places, 200 transitions, 2731 flow [2025-03-14 01:13:28,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2256, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2731, PETRI_PLACES=173, PETRI_TRANSITIONS=200} [2025-03-14 01:13:28,601 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 152 predicate places. [2025-03-14 01:13:28,601 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 200 transitions, 2731 flow [2025-03-14 01:13:28,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:28,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:13:28,602 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:13:28,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-14 01:13:28,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-14 01:13:28,802 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:13:28,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:13:28,803 INFO L85 PathProgramCache]: Analyzing trace with hash 834831410, now seen corresponding path program 8 times [2025-03-14 01:13:28,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:13:28,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431474546] [2025-03-14 01:13:28,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:13:28,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:13:28,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-14 01:13:28,820 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 01:13:28,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:13:28,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:28,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:13:28,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:13:28,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431474546] [2025-03-14 01:13:28,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431474546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:13:28,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447291832] [2025-03-14 01:13:28,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:13:28,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:13:28,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:13:28,966 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:13:28,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-14 01:13:29,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-14 01:13:29,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 01:13:29,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:13:29,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:29,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-14 01:13:29,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:13:29,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:13:29,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 109 [2025-03-14 01:13:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:13:29,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:13:29,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:13:29,627 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 63 [2025-03-14 01:13:29,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:13:29,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447291832] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:13:29,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:13:29,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 18 [2025-03-14 01:13:29,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219271349] [2025-03-14 01:13:29,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:13:29,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 01:13:29,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:13:29,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 01:13:29,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:13:29,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:13:29,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 200 transitions, 2731 flow. Second operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 18 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:29,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:13:29,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:13:29,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:13:30,625 INFO L124 PetriNetUnfolderBase]: 438/897 cut-off events. [2025-03-14 01:13:30,625 INFO L125 PetriNetUnfolderBase]: For 6283/6283 co-relation queries the response was YES. [2025-03-14 01:13:30,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5775 conditions, 897 events. 438/897 cut-off events. For 6283/6283 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4927 event pairs, 6 based on Foata normal form. 3/899 useless extension candidates. Maximal degree in co-relation 5719. Up to 360 conditions per place. [2025-03-14 01:13:30,633 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 159 selfloop transitions, 92 changer transitions 4/256 dead transitions. [2025-03-14 01:13:30,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 256 transitions, 3572 flow [2025-03-14 01:13:30,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 01:13:30,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 01:13:30,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 148 transitions. [2025-03-14 01:13:30,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4625 [2025-03-14 01:13:30,635 INFO L175 Difference]: Start difference. First operand has 173 places, 200 transitions, 2731 flow. Second operand 16 states and 148 transitions. [2025-03-14 01:13:30,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 256 transitions, 3572 flow [2025-03-14 01:13:30,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 256 transitions, 3381 flow, removed 40 selfloop flow, removed 5 redundant places. [2025-03-14 01:13:30,673 INFO L231 Difference]: Finished difference. Result has 185 places, 207 transitions, 2838 flow [2025-03-14 01:13:30,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2532, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2838, PETRI_PLACES=185, PETRI_TRANSITIONS=207} [2025-03-14 01:13:30,673 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 164 predicate places. [2025-03-14 01:13:30,673 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 207 transitions, 2838 flow [2025-03-14 01:13:30,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 18 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:30,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:13:30,674 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:13:30,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-14 01:13:30,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-14 01:13:30,876 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 01:13:30,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:13:30,876 INFO L85 PathProgramCache]: Analyzing trace with hash 729371270, now seen corresponding path program 9 times [2025-03-14 01:13:30,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:13:30,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15662637] [2025-03-14 01:13:30,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:13:30,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:13:30,882 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-03-14 01:13:30,899 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 01:13:30,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:13:30,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:13:31,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:13:31,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15662637] [2025-03-14 01:13:31,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15662637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:13:31,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285915669] [2025-03-14 01:13:31,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:13:31,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:13:31,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:13:31,013 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:13:31,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-14 01:13:31,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-03-14 01:13:31,111 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 01:13:31,111 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:13:31,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:13:31,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-14 01:13:31,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:13:31,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:13:31,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:13:31,763 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-03-14 01:13:31,763 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 42 [2025-03-14 01:13:31,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:13:31,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285915669] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:13:31,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:13:31,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2025-03-14 01:13:31,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675187974] [2025-03-14 01:13:31,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:13:31,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-14 01:13:31,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:13:31,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-14 01:13:31,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-03-14 01:13:31,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-14 01:13:31,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 207 transitions, 2838 flow. Second operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:13:31,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:13:31,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-14 01:13:31,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand