./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-send-receive.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 4eda2bf92bccdcc8638b67653fb7fdefc015ff9c815b317ad1009deb61d04585 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:51:02,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:51:02,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:51:02,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:51:02,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:51:02,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:51:02,424 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:51:02,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:51:02,425 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:51:02,425 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:51:02,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:51:02,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:51:02,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:51:02,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:51:02,425 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:51:02,425 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:51:02,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:51:02,425 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:51:02,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:51:02,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:51:02,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:51:02,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:51:02,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:51:02,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:51:02,426 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:51:02,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:51:02,426 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:51:02,426 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:51:02,426 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:51:02,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:51:02,426 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:51:02,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:51:02,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:51:02,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:51:02,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:51:02,426 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:51:02,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:51:02,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:51:02,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:51:02,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:51:02,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:51:02,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:51:02,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:51:02,426 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 -> 4eda2bf92bccdcc8638b67653fb7fdefc015ff9c815b317ad1009deb61d04585 [2025-03-13 21:51:02,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:51:02,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:51:02,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:51:02,648 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:51:02,649 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:51:02,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2025-03-13 21:51:03,772 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bd756896/010fba2bb1b549ff9420f3974211c46f/FLAGb59a0b18d [2025-03-13 21:51:03,991 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:51:03,992 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2025-03-13 21:51:03,999 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bd756896/010fba2bb1b549ff9420f3974211c46f/FLAGb59a0b18d [2025-03-13 21:51:04,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bd756896/010fba2bb1b549ff9420f3974211c46f [2025-03-13 21:51:04,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:51:04,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:51:04,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:51:04,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:51:04,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:51:04,321 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:51:04" (1/1) ... [2025-03-13 21:51:04,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a72b5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:04, skipping insertion in model container [2025-03-13 21:51:04,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:51:04" (1/1) ... [2025-03-13 21:51:04,335 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:51:04,455 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c[3146,3159] [2025-03-13 21:51:04,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:51:04,472 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:51:04,492 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c[3146,3159] [2025-03-13 21:51:04,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:51:04,508 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:51:04,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:04 WrapperNode [2025-03-13 21:51:04,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:51:04,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:51:04,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:51:04,510 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:51:04,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:04" (1/1) ... [2025-03-13 21:51:04,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:04" (1/1) ... [2025-03-13 21:51:04,530 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 139 [2025-03-13 21:51:04,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:51:04,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:51:04,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:51:04,531 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:51:04,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:04" (1/1) ... [2025-03-13 21:51:04,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:04" (1/1) ... [2025-03-13 21:51:04,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:04" (1/1) ... [2025-03-13 21:51:04,551 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [4, 2]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 1 writes are split as follows [1, 0]. [2025-03-13 21:51:04,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:04" (1/1) ... [2025-03-13 21:51:04,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:04" (1/1) ... [2025-03-13 21:51:04,562 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:04" (1/1) ... [2025-03-13 21:51:04,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:04" (1/1) ... [2025-03-13 21:51:04,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:04" (1/1) ... [2025-03-13 21:51:04,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:04" (1/1) ... [2025-03-13 21:51:04,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:51:04,565 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:51:04,565 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:51:04,565 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:51:04,570 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:04" (1/1) ... [2025-03-13 21:51:04,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:51:04,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:51:04,596 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-13 21:51:04,600 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-13 21:51:04,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:51:04,615 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:51:04,616 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:51:04,616 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:51:04,616 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:51:04,616 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:51:04,616 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:51:04,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:51:04,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:51:04,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:51:04,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:51:04,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:51:04,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:51:04,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:51:04,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:51:04,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:51:04,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:51:04,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:51:04,617 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:51:04,688 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:51:04,690 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:51:04,901 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:51:04,902 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:51:04,902 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:51:05,089 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:51:05,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:51:05 BoogieIcfgContainer [2025-03-13 21:51:05,089 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:51:05,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:51:05,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:51:05,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:51:05,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:51:04" (1/3) ... [2025-03-13 21:51:05,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15879b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:51:05, skipping insertion in model container [2025-03-13 21:51:05,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:51:04" (2/3) ... [2025-03-13 21:51:05,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15879b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:51:05, skipping insertion in model container [2025-03-13 21:51:05,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:51:05" (3/3) ... [2025-03-13 21:51:05,097 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2025-03-13 21:51:05,108 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:51:05,110 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-send-receive.wvr.c that has 4 procedures, 33 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-13 21:51:05,110 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:51:05,159 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 21:51:05,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 93 flow [2025-03-13 21:51:05,225 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2025-03-13 21:51:05,227 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:51:05,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 33 events. 4/33 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2025-03-13 21:51:05,232 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 36 transitions, 93 flow [2025-03-13 21:51:05,234 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 32 transitions, 82 flow [2025-03-13 21:51:05,242 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:51:05,249 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;@3bbec488, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:51:05,250 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-13 21:51:05,262 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:51:05,264 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2025-03-13 21:51:05,264 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:51:05,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:05,265 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:51:05,266 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:51:05,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:05,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2109680172, now seen corresponding path program 1 times [2025-03-13 21:51:05,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:05,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180361130] [2025-03-13 21:51:05,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:51:05,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:05,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:51:05,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:51:05,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:51:05,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:05,747 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-13 21:51:05,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:05,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180361130] [2025-03-13 21:51:05,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180361130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:51:05,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:51:05,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:51:05,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607028511] [2025-03-13 21:51:05,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:51:05,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:51:05,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:05,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:51:05,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:51:05,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-03-13 21:51:05,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:05,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:05,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-03-13 21:51:05,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:06,111 INFO L124 PetriNetUnfolderBase]: 627/1033 cut-off events. [2025-03-13 21:51:06,112 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-13 21:51:06,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2027 conditions, 1033 events. 627/1033 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4645 event pairs, 66 based on Foata normal form. 100/1073 useless extension candidates. Maximal degree in co-relation 1956. Up to 350 conditions per place. [2025-03-13 21:51:06,118 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 56 selfloop transitions, 4 changer transitions 5/72 dead transitions. [2025-03-13 21:51:06,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 72 transitions, 304 flow [2025-03-13 21:51:06,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:51:06,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:51:06,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2025-03-13 21:51:06,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-03-13 21:51:06,132 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 82 flow. Second operand 5 states and 117 transitions. [2025-03-13 21:51:06,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 72 transitions, 304 flow [2025-03-13 21:51:06,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 72 transitions, 284 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 21:51:06,140 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 90 flow [2025-03-13 21:51:06,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-03-13 21:51:06,145 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2025-03-13 21:51:06,146 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 90 flow [2025-03-13 21:51:06,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:06,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:06,146 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:51:06,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:51:06,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:51:06,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:06,147 INFO L85 PathProgramCache]: Analyzing trace with hash 797378811, now seen corresponding path program 1 times [2025-03-13 21:51:06,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:06,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958137731] [2025-03-13 21:51:06,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:51:06,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:06,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:51:06,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:51:06,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:51:06,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:06,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:06,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:06,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958137731] [2025-03-13 21:51:06,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958137731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:51:06,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:51:06,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:51:06,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548569221] [2025-03-13 21:51:06,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:51:06,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:51:06,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:06,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:51:06,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:51:06,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-03-13 21:51:06,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-13 21:51:06,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:06,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-03-13 21:51:06,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:06,311 INFO L124 PetriNetUnfolderBase]: 329/567 cut-off events. [2025-03-13 21:51:06,311 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-03-13 21:51:06,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 567 events. 329/567 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2082 event pairs, 140 based on Foata normal form. 21/527 useless extension candidates. Maximal degree in co-relation 480. Up to 407 conditions per place. [2025-03-13 21:51:06,329 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 30 selfloop transitions, 3 changer transitions 1/41 dead transitions. [2025-03-13 21:51:06,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 178 flow [2025-03-13 21:51:06,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:51:06,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:51:06,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-03-13 21:51:06,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2025-03-13 21:51:06,330 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 90 flow. Second operand 3 states and 64 transitions. [2025-03-13 21:51:06,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 178 flow [2025-03-13 21:51:06,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 173 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:51:06,331 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 105 flow [2025-03-13 21:51:06,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2025-03-13 21:51:06,332 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2025-03-13 21:51:06,332 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 105 flow [2025-03-13 21:51:06,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-13 21:51:06,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:06,332 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:51:06,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:51:06,332 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:51:06,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:06,333 INFO L85 PathProgramCache]: Analyzing trace with hash -443279971, now seen corresponding path program 1 times [2025-03-13 21:51:06,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:06,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168380791] [2025-03-13 21:51:06,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:51:06,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:06,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:51:06,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:51:06,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:51:06,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:06,453 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-13 21:51:06,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:06,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168380791] [2025-03-13 21:51:06,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168380791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:51:06,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:51:06,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:51:06,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459983914] [2025-03-13 21:51:06,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:51:06,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:51:06,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:06,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:51:06,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:51:06,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-03-13 21:51:06,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-13 21:51:06,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:06,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-03-13 21:51:06,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:06,548 INFO L124 PetriNetUnfolderBase]: 364/634 cut-off events. [2025-03-13 21:51:06,549 INFO L125 PetriNetUnfolderBase]: For 283/283 co-relation queries the response was YES. [2025-03-13 21:51:06,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1528 conditions, 634 events. 364/634 cut-off events. For 283/283 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2428 event pairs, 263 based on Foata normal form. 0/572 useless extension candidates. Maximal degree in co-relation 705. Up to 499 conditions per place. [2025-03-13 21:51:06,551 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 27 selfloop transitions, 2 changer transitions 11/47 dead transitions. [2025-03-13 21:51:06,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 214 flow [2025-03-13 21:51:06,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:51:06,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:51:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-03-13 21:51:06,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-13 21:51:06,553 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 105 flow. Second operand 4 states and 78 transitions. [2025-03-13 21:51:06,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 214 flow [2025-03-13 21:51:06,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:51:06,558 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 116 flow [2025-03-13 21:51:06,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2025-03-13 21:51:06,558 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2025-03-13 21:51:06,558 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 116 flow [2025-03-13 21:51:06,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-13 21:51:06,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:06,559 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:51:06,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:51:06,559 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:51:06,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:06,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1515313704, now seen corresponding path program 1 times [2025-03-13 21:51:06,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:06,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579688033] [2025-03-13 21:51:06,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:51:06,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:06,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 21:51:06,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:51:06,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:51:06,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:51:06,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:06,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579688033] [2025-03-13 21:51:06,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579688033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:51:06,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:51:06,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:51:06,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242112201] [2025-03-13 21:51:06,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:51:06,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:51:06,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:06,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:51:06,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:51:06,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-03-13 21:51:06,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-13 21:51:06,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:06,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-03-13 21:51:06,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:06,801 INFO L124 PetriNetUnfolderBase]: 287/492 cut-off events. [2025-03-13 21:51:06,801 INFO L125 PetriNetUnfolderBase]: For 252/252 co-relation queries the response was YES. [2025-03-13 21:51:06,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214 conditions, 492 events. 287/492 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1681 event pairs, 54 based on Foata normal form. 24/499 useless extension candidates. Maximal degree in co-relation 1198. Up to 200 conditions per place. [2025-03-13 21:51:06,806 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 37 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2025-03-13 21:51:06,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 47 transitions, 229 flow [2025-03-13 21:51:06,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:51:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:51:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-03-13 21:51:06,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2025-03-13 21:51:06,808 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 116 flow. Second operand 4 states and 77 transitions. [2025-03-13 21:51:06,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 47 transitions, 229 flow [2025-03-13 21:51:06,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 221 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-13 21:51:06,811 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 120 flow [2025-03-13 21:51:06,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2025-03-13 21:51:06,811 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2025-03-13 21:51:06,812 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 120 flow [2025-03-13 21:51:06,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-13 21:51:06,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:06,812 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:51:06,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:51:06,813 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:51:06,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:06,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1332999088, now seen corresponding path program 2 times [2025-03-13 21:51:06,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:06,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048481121] [2025-03-13 21:51:06,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:51:06,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:06,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-13 21:51:06,830 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-03-13 21:51:06,830 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:51:06,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:51:06,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:06,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048481121] [2025-03-13 21:51:06,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048481121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:51:06,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:51:06,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:51:06,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087700493] [2025-03-13 21:51:06,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:51:06,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:51:06,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:06,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:51:06,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:51:06,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-03-13 21:51:06,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-13 21:51:06,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:06,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-03-13 21:51:06,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:07,041 INFO L124 PetriNetUnfolderBase]: 359/615 cut-off events. [2025-03-13 21:51:07,041 INFO L125 PetriNetUnfolderBase]: For 346/346 co-relation queries the response was YES. [2025-03-13 21:51:07,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1488 conditions, 615 events. 359/615 cut-off events. For 346/346 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2221 event pairs, 22 based on Foata normal form. 16/619 useless extension candidates. Maximal degree in co-relation 1467. Up to 199 conditions per place. [2025-03-13 21:51:07,046 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 54 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2025-03-13 21:51:07,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 65 transitions, 321 flow [2025-03-13 21:51:07,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:51:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:51:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-03-13 21:51:07,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5722222222222222 [2025-03-13 21:51:07,048 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 120 flow. Second operand 5 states and 103 transitions. [2025-03-13 21:51:07,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 65 transitions, 321 flow [2025-03-13 21:51:07,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 65 transitions, 313 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:51:07,052 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 130 flow [2025-03-13 21:51:07,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2025-03-13 21:51:07,054 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2025-03-13 21:51:07,054 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 130 flow [2025-03-13 21:51:07,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-13 21:51:07,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:07,054 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:51:07,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:51:07,055 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:51:07,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:07,056 INFO L85 PathProgramCache]: Analyzing trace with hash 960355754, now seen corresponding path program 3 times [2025-03-13 21:51:07,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:07,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565073760] [2025-03-13 21:51:07,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:51:07,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:07,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-03-13 21:51:07,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:51:07,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:51:07,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:07,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:51:07,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:07,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565073760] [2025-03-13 21:51:07,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565073760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:51:07,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:51:07,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:51:07,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9511341] [2025-03-13 21:51:07,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:51:07,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:51:07,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:07,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:51:07,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:51:07,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2025-03-13 21:51:07,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:07,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:07,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2025-03-13 21:51:07,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:07,625 INFO L124 PetriNetUnfolderBase]: 1346/2136 cut-off events. [2025-03-13 21:51:07,625 INFO L125 PetriNetUnfolderBase]: For 1045/1045 co-relation queries the response was YES. [2025-03-13 21:51:07,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5349 conditions, 2136 events. 1346/2136 cut-off events. For 1045/1045 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9969 event pairs, 217 based on Foata normal form. 30/2107 useless extension candidates. Maximal degree in co-relation 5327. Up to 728 conditions per place. [2025-03-13 21:51:07,634 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 82 selfloop transitions, 12 changer transitions 0/100 dead transitions. [2025-03-13 21:51:07,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 100 transitions, 540 flow [2025-03-13 21:51:07,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:51:07,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:51:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2025-03-13 21:51:07,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6342592592592593 [2025-03-13 21:51:07,635 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 130 flow. Second operand 6 states and 137 transitions. [2025-03-13 21:51:07,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 100 transitions, 540 flow [2025-03-13 21:51:07,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 100 transitions, 528 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:51:07,638 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 223 flow [2025-03-13 21:51:07,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2025-03-13 21:51:07,638 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2025-03-13 21:51:07,638 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 223 flow [2025-03-13 21:51:07,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:51:07,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:07,639 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:51:07,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:51:07,639 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:51:07,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:07,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1071676766, now seen corresponding path program 4 times [2025-03-13 21:51:07,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:07,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723831656] [2025-03-13 21:51:07,640 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:51:07,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:07,645 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-13 21:51:07,653 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:51:07,653 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:51:07,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:07,789 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-13 21:51:07,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:07,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723831656] [2025-03-13 21:51:07,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723831656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:51:07,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804695413] [2025-03-13 21:51:07,789 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:51:07,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:07,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:51:07,792 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-13 21:51:07,793 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-13 21:51:07,834 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-13 21:51:07,852 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:51:07,853 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:51:07,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:07,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:51:07,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:51:07,915 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-13 21:51:07,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:51:08,020 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-13 21:51:08,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804695413] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:51:08,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:51:08,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2025-03-13 21:51:08,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750593078] [2025-03-13 21:51:08,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:51:08,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:51:08,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:08,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:51:08,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:51:08,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-03-13 21:51:08,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 223 flow. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 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-13 21:51:08,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:08,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-03-13 21:51:08,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:08,639 INFO L124 PetriNetUnfolderBase]: 3035/4514 cut-off events. [2025-03-13 21:51:08,639 INFO L125 PetriNetUnfolderBase]: For 4330/4330 co-relation queries the response was YES. [2025-03-13 21:51:08,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13208 conditions, 4514 events. 3035/4514 cut-off events. For 4330/4330 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 21517 event pairs, 76 based on Foata normal form. 206/4527 useless extension candidates. Maximal degree in co-relation 13183. Up to 848 conditions per place. [2025-03-13 21:51:08,657 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 134 selfloop transitions, 40 changer transitions 49/226 dead transitions. [2025-03-13 21:51:08,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 226 transitions, 1359 flow [2025-03-13 21:51:08,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-13 21:51:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-13 21:51:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 330 transitions. [2025-03-13 21:51:08,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-13 21:51:08,659 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 223 flow. Second operand 22 states and 330 transitions. [2025-03-13 21:51:08,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 226 transitions, 1359 flow [2025-03-13 21:51:08,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 226 transitions, 1359 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:51:08,668 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 554 flow [2025-03-13 21:51:08,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=554, PETRI_PLACES=88, PETRI_TRANSITIONS=76} [2025-03-13 21:51:08,669 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 50 predicate places. [2025-03-13 21:51:08,669 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 554 flow [2025-03-13 21:51:08,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 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-13 21:51:08,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:08,669 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:51:08,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:51:08,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:08,870 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:51:08,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:08,870 INFO L85 PathProgramCache]: Analyzing trace with hash -2005864276, now seen corresponding path program 5 times [2025-03-13 21:51:08,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:08,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394307522] [2025-03-13 21:51:08,870 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:51:08,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:08,877 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-13 21:51:08,889 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:51:08,890 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:51:08,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:09,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:09,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:09,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394307522] [2025-03-13 21:51:09,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394307522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:51:09,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533644571] [2025-03-13 21:51:09,521 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:51:09,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:09,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:51:09,524 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-13 21:51:09,526 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-13 21:51:09,571 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-13 21:51:09,594 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:51:09,594 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:51:09,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:09,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-13 21:51:09,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:51:09,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-13 21:51:09,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:09,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:51:10,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2025-03-13 21:51:10,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:51:10,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 68 [2025-03-13 21:51:10,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:10,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533644571] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:51:10,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:51:10,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 28 [2025-03-13 21:51:10,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146604869] [2025-03-13 21:51:10,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:51:10,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-13 21:51:10,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:10,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-13 21:51:10,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2025-03-13 21:51:10,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-03-13 21:51:10,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 76 transitions, 554 flow. Second operand has 29 states, 29 states have (on average 8.413793103448276) internal successors, (244), 29 states have internal predecessors, (244), 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-13 21:51:10,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:10,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-03-13 21:51:10,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:13,011 INFO L124 PetriNetUnfolderBase]: 9251/14146 cut-off events. [2025-03-13 21:51:13,011 INFO L125 PetriNetUnfolderBase]: For 70146/70146 co-relation queries the response was YES. [2025-03-13 21:51:13,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57920 conditions, 14146 events. 9251/14146 cut-off events. For 70146/70146 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 86280 event pairs, 798 based on Foata normal form. 616/14758 useless extension candidates. Maximal degree in co-relation 51644. Up to 2137 conditions per place. [2025-03-13 21:51:13,092 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 371 selfloop transitions, 125 changer transitions 153/652 dead transitions. [2025-03-13 21:51:13,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 652 transitions, 5899 flow [2025-03-13 21:51:13,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-13 21:51:13,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-13 21:51:13,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 679 transitions. [2025-03-13 21:51:13,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4286616161616162 [2025-03-13 21:51:13,095 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 554 flow. Second operand 44 states and 679 transitions. [2025-03-13 21:51:13,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 652 transitions, 5899 flow [2025-03-13 21:51:13,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 652 transitions, 5809 flow, removed 37 selfloop flow, removed 1 redundant places. [2025-03-13 21:51:13,209 INFO L231 Difference]: Finished difference. Result has 150 places, 195 transitions, 1802 flow [2025-03-13 21:51:13,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=1802, PETRI_PLACES=150, PETRI_TRANSITIONS=195} [2025-03-13 21:51:13,210 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 112 predicate places. [2025-03-13 21:51:13,210 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 195 transitions, 1802 flow [2025-03-13 21:51:13,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.413793103448276) internal successors, (244), 29 states have internal predecessors, (244), 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-13 21:51:13,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:13,211 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:51:13,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-13 21:51:13,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-13 21:51:13,415 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:51:13,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:13,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1214832595, now seen corresponding path program 6 times [2025-03-13 21:51:13,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:13,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050411658] [2025-03-13 21:51:13,416 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:51:13,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:13,422 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 3 equivalence classes. [2025-03-13 21:51:13,432 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 33 statements. [2025-03-13 21:51:13,433 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:51:13,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:13,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-13 21:51:13,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:13,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050411658] [2025-03-13 21:51:13,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050411658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:51:13,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:51:13,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:51:13,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994085374] [2025-03-13 21:51:13,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:51:13,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:51:13,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:13,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:51:13,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:51:13,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-03-13 21:51:13,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 195 transitions, 1802 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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-13 21:51:13,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:13,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-03-13 21:51:13,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:14,590 INFO L124 PetriNetUnfolderBase]: 4787/8177 cut-off events. [2025-03-13 21:51:14,590 INFO L125 PetriNetUnfolderBase]: For 102527/102691 co-relation queries the response was YES. [2025-03-13 21:51:14,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42308 conditions, 8177 events. 4787/8177 cut-off events. For 102527/102691 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 54669 event pairs, 703 based on Foata normal form. 236/8113 useless extension candidates. Maximal degree in co-relation 36120. Up to 2573 conditions per place. [2025-03-13 21:51:14,667 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 151 selfloop transitions, 59 changer transitions 51/293 dead transitions. [2025-03-13 21:51:14,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 293 transitions, 3222 flow [2025-03-13 21:51:14,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:51:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:51:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2025-03-13 21:51:14,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5486111111111112 [2025-03-13 21:51:14,668 INFO L175 Difference]: Start difference. First operand has 150 places, 195 transitions, 1802 flow. Second operand 8 states and 158 transitions. [2025-03-13 21:51:14,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 293 transitions, 3222 flow [2025-03-13 21:51:14,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 293 transitions, 2928 flow, removed 77 selfloop flow, removed 10 redundant places. [2025-03-13 21:51:14,885 INFO L231 Difference]: Finished difference. Result has 149 places, 199 transitions, 1772 flow [2025-03-13 21:51:14,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1568, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1772, PETRI_PLACES=149, PETRI_TRANSITIONS=199} [2025-03-13 21:51:14,886 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 111 predicate places. [2025-03-13 21:51:14,886 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 199 transitions, 1772 flow [2025-03-13 21:51:14,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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-13 21:51:14,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:14,886 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:51:14,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:51:14,886 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:51:14,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:14,887 INFO L85 PathProgramCache]: Analyzing trace with hash -236721253, now seen corresponding path program 7 times [2025-03-13 21:51:14,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:14,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759393476] [2025-03-13 21:51:14,887 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:51:14,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:14,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 21:51:14,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:51:14,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:51:14,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:51:14,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:14,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759393476] [2025-03-13 21:51:14,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759393476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:51:14,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:51:14,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:51:14,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791312369] [2025-03-13 21:51:14,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:51:14,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:51:14,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:14,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:51:14,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:51:14,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-03-13 21:51:14,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 199 transitions, 1772 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-13 21:51:14,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:14,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-03-13 21:51:14,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:16,200 INFO L124 PetriNetUnfolderBase]: 7771/13610 cut-off events. [2025-03-13 21:51:16,201 INFO L125 PetriNetUnfolderBase]: For 126622/126920 co-relation queries the response was YES. [2025-03-13 21:51:16,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68503 conditions, 13610 events. 7771/13610 cut-off events. For 126622/126920 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 98783 event pairs, 2232 based on Foata normal form. 342/13601 useless extension candidates. Maximal degree in co-relation 56757. Up to 5875 conditions per place. [2025-03-13 21:51:16,291 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 242 selfloop transitions, 48 changer transitions 1/323 dead transitions. [2025-03-13 21:51:16,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 323 transitions, 3505 flow [2025-03-13 21:51:16,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:51:16,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:51:16,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-03-13 21:51:16,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-03-13 21:51:16,292 INFO L175 Difference]: Start difference. First operand has 149 places, 199 transitions, 1772 flow. Second operand 4 states and 99 transitions. [2025-03-13 21:51:16,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 323 transitions, 3505 flow [2025-03-13 21:51:16,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 323 transitions, 3421 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-03-13 21:51:16,452 INFO L231 Difference]: Finished difference. Result has 151 places, 236 transitions, 2212 flow [2025-03-13 21:51:16,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1682, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2212, PETRI_PLACES=151, PETRI_TRANSITIONS=236} [2025-03-13 21:51:16,453 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 113 predicate places. [2025-03-13 21:51:16,453 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 236 transitions, 2212 flow [2025-03-13 21:51:16,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-13 21:51:16,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:16,454 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:51:16,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:51:16,454 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:51:16,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:16,454 INFO L85 PathProgramCache]: Analyzing trace with hash 697551291, now seen corresponding path program 8 times [2025-03-13 21:51:16,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:16,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202991351] [2025-03-13 21:51:16,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:51:16,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:16,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-13 21:51:16,473 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 21:51:16,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:51:16,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:51:16,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:16,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202991351] [2025-03-13 21:51:16,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202991351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:51:16,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181928481] [2025-03-13 21:51:16,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:51:16,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:16,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:51:16,551 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-13 21:51:16,553 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-13 21:51:16,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-13 21:51:16,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 21:51:16,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:51:16,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:16,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:51:16,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:51:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:51:16,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:51:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:51:16,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181928481] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:51:16,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:51:16,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-13 21:51:16,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087879086] [2025-03-13 21:51:16,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:51:16,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 21:51:16,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:16,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 21:51:16,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:51:16,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2025-03-13 21:51:16,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 236 transitions, 2212 flow. Second operand has 15 states, 15 states have (on average 13.133333333333333) internal successors, (197), 15 states have internal predecessors, (197), 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-13 21:51:16,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:16,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2025-03-13 21:51:16,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:18,008 INFO L124 PetriNetUnfolderBase]: 5844/10233 cut-off events. [2025-03-13 21:51:18,008 INFO L125 PetriNetUnfolderBase]: For 105397/105587 co-relation queries the response was YES. [2025-03-13 21:51:18,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55042 conditions, 10233 events. 5844/10233 cut-off events. For 105397/105587 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 70303 event pairs, 3299 based on Foata normal form. 110/9973 useless extension candidates. Maximal degree in co-relation 45664. Up to 8219 conditions per place. [2025-03-13 21:51:18,070 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 132 selfloop transitions, 3 changer transitions 33/191 dead transitions. [2025-03-13 21:51:18,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 191 transitions, 2076 flow [2025-03-13 21:51:18,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:51:18,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:51:18,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2025-03-13 21:51:18,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4801587301587302 [2025-03-13 21:51:18,071 INFO L175 Difference]: Start difference. First operand has 151 places, 236 transitions, 2212 flow. Second operand 7 states and 121 transitions. [2025-03-13 21:51:18,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 191 transitions, 2076 flow [2025-03-13 21:51:18,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 191 transitions, 2027 flow, removed 21 selfloop flow, removed 5 redundant places. [2025-03-13 21:51:18,166 INFO L231 Difference]: Finished difference. Result has 142 places, 158 transitions, 1463 flow [2025-03-13 21:51:18,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1463, PETRI_PLACES=142, PETRI_TRANSITIONS=158} [2025-03-13 21:51:18,168 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 104 predicate places. [2025-03-13 21:51:18,168 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 158 transitions, 1463 flow [2025-03-13 21:51:18,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.133333333333333) internal successors, (197), 15 states have internal predecessors, (197), 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-13 21:51:18,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:18,169 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:51:18,175 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-13 21:51:18,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:18,373 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:51:18,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:18,374 INFO L85 PathProgramCache]: Analyzing trace with hash -875500820, now seen corresponding path program 9 times [2025-03-13 21:51:18,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:18,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871311657] [2025-03-13 21:51:18,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:51:18,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:18,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 2 equivalence classes. [2025-03-13 21:51:18,399 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:51:18,399 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:51:18,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:18,466 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:51:18,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:18,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871311657] [2025-03-13 21:51:18,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871311657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:51:18,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:51:18,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:51:18,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152831610] [2025-03-13 21:51:18,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:51:18,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:51:18,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:18,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:51:18,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:51:18,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-03-13 21:51:18,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 158 transitions, 1463 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-13 21:51:18,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:18,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-03-13 21:51:18,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:19,920 INFO L124 PetriNetUnfolderBase]: 10059/16577 cut-off events. [2025-03-13 21:51:19,920 INFO L125 PetriNetUnfolderBase]: For 146994/147078 co-relation queries the response was YES. [2025-03-13 21:51:19,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85008 conditions, 16577 events. 10059/16577 cut-off events. For 146994/147078 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 108798 event pairs, 2737 based on Foata normal form. 1020/17462 useless extension candidates. Maximal degree in co-relation 84947. Up to 8406 conditions per place. [2025-03-13 21:51:20,026 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 191 selfloop transitions, 10 changer transitions 0/207 dead transitions. [2025-03-13 21:51:20,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 207 transitions, 2344 flow [2025-03-13 21:51:20,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:51:20,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:51:20,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-03-13 21:51:20,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-13 21:51:20,027 INFO L175 Difference]: Start difference. First operand has 142 places, 158 transitions, 1463 flow. Second operand 4 states and 78 transitions. [2025-03-13 21:51:20,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 207 transitions, 2344 flow [2025-03-13 21:51:20,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 207 transitions, 2322 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-03-13 21:51:20,138 INFO L231 Difference]: Finished difference. Result has 127 places, 157 transitions, 1494 flow [2025-03-13 21:51:20,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1494, PETRI_PLACES=127, PETRI_TRANSITIONS=157} [2025-03-13 21:51:20,138 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 89 predicate places. [2025-03-13 21:51:20,138 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 157 transitions, 1494 flow [2025-03-13 21:51:20,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-13 21:51:20,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:20,139 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:51:20,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:51:20,139 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:51:20,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:20,139 INFO L85 PathProgramCache]: Analyzing trace with hash -472493502, now seen corresponding path program 1 times [2025-03-13 21:51:20,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:20,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3807943] [2025-03-13 21:51:20,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:51:20,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:20,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-13 21:51:20,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:51:20,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:51:20,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:21,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:21,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:21,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3807943] [2025-03-13 21:51:21,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3807943] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:51:21,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046296477] [2025-03-13 21:51:21,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:51:21,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:21,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:51:21,034 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-13 21:51:21,036 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-13 21:51:21,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-13 21:51:21,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:51:21,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:51:21,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:21,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-13 21:51:21,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:51:21,484 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:21,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:51:21,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:51:21,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-03-13 21:51:22,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:22,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046296477] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:51:22,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:51:22,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 40 [2025-03-13 21:51:22,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084748244] [2025-03-13 21:51:22,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:51:22,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-13 21:51:22,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:22,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-13 21:51:22,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1409, Unknown=0, NotChecked=0, Total=1640 [2025-03-13 21:51:22,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-03-13 21:51:22,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 157 transitions, 1494 flow. Second operand has 41 states, 41 states have (on average 8.341463414634147) internal successors, (342), 41 states have internal predecessors, (342), 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-13 21:51:22,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:22,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-03-13 21:51:22,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:34,922 INFO L124 PetriNetUnfolderBase]: 50050/78848 cut-off events. [2025-03-13 21:51:34,922 INFO L125 PetriNetUnfolderBase]: For 762830/762830 co-relation queries the response was YES. [2025-03-13 21:51:35,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406729 conditions, 78848 events. 50050/78848 cut-off events. For 762830/762830 co-relation queries the response was YES. Maximal size of possible extension queue 1331. Compared 580656 event pairs, 4133 based on Foata normal form. 2888/81735 useless extension candidates. Maximal degree in co-relation 347784. Up to 11573 conditions per place. [2025-03-13 21:51:35,494 INFO L140 encePairwiseOnDemand]: 22/36 looper letters, 1020 selfloop transitions, 497 changer transitions 643/2163 dead transitions. [2025-03-13 21:51:35,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 2163 transitions, 24326 flow [2025-03-13 21:51:35,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2025-03-13 21:51:35,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2025-03-13 21:51:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 1779 transitions. [2025-03-13 21:51:35,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4260057471264368 [2025-03-13 21:51:35,498 INFO L175 Difference]: Start difference. First operand has 127 places, 157 transitions, 1494 flow. Second operand 116 states and 1779 transitions. [2025-03-13 21:51:35,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 2163 transitions, 24326 flow [2025-03-13 21:51:36,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 2163 transitions, 24022 flow, removed 150 selfloop flow, removed 1 redundant places. [2025-03-13 21:51:36,328 INFO L231 Difference]: Finished difference. Result has 308 places, 594 transitions, 8085 flow [2025-03-13 21:51:36,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=116, PETRI_FLOW=8085, PETRI_PLACES=308, PETRI_TRANSITIONS=594} [2025-03-13 21:51:36,329 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 270 predicate places. [2025-03-13 21:51:36,329 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 594 transitions, 8085 flow [2025-03-13 21:51:36,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 8.341463414634147) internal successors, (342), 41 states have internal predecessors, (342), 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-13 21:51:36,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:51:36,329 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:51:36,335 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-13 21:51:36,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:36,530 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:51:36,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:51:36,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1156531666, now seen corresponding path program 2 times [2025-03-13 21:51:36,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:51:36,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71564734] [2025-03-13 21:51:36,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:51:36,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:51:36,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-13 21:51:36,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:51:36,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:51:36,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:37,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:51:37,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71564734] [2025-03-13 21:51:37,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71564734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:51:37,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792770786] [2025-03-13 21:51:37,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:51:37,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:51:37,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:51:37,090 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-13 21:51:37,092 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-13 21:51:37,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-13 21:51:37,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:51:37,153 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:51:37,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:51:37,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-13 21:51:37,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:51:37,212 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-13 21:51:37,595 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:37,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:51:38,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 105 [2025-03-13 21:51:38,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:51:38,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 237 treesize of output 208 [2025-03-13 21:51:38,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:51:38,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792770786] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:51:38,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:51:38,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 38 [2025-03-13 21:51:38,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856711718] [2025-03-13 21:51:38,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:51:38,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-13 21:51:38,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:51:38,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-13 21:51:38,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1243, Unknown=0, NotChecked=0, Total=1482 [2025-03-13 21:51:38,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-03-13 21:51:38,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 594 transitions, 8085 flow. Second operand has 39 states, 39 states have (on average 8.512820512820513) internal successors, (332), 39 states have internal predecessors, (332), 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-13 21:51:38,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:51:38,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-03-13 21:51:38,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:51:55,834 INFO L124 PetriNetUnfolderBase]: 45555/71863 cut-off events. [2025-03-13 21:51:55,834 INFO L125 PetriNetUnfolderBase]: For 5800189/5800189 co-relation queries the response was YES. [2025-03-13 21:51:57,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572687 conditions, 71863 events. 45555/71863 cut-off events. For 5800189/5800189 co-relation queries the response was YES. Maximal size of possible extension queue 1414. Compared 525484 event pairs, 6347 based on Foata normal form. 1848/73708 useless extension candidates. Maximal degree in co-relation 503032. Up to 19707 conditions per place. [2025-03-13 21:51:57,304 INFO L140 encePairwiseOnDemand]: 21/36 looper letters, 661 selfloop transitions, 511 changer transitions 403/1578 dead transitions. [2025-03-13 21:51:57,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 1578 transitions, 23113 flow [2025-03-13 21:51:57,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-13 21:51:57,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2025-03-13 21:51:57,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 1069 transitions. [2025-03-13 21:51:57,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39071637426900585 [2025-03-13 21:51:57,453 INFO L175 Difference]: Start difference. First operand has 308 places, 594 transitions, 8085 flow. Second operand 76 states and 1069 transitions. [2025-03-13 21:51:57,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 1578 transitions, 23113 flow [2025-03-13 21:52:20,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 1578 transitions, 20869 flow, removed 850 selfloop flow, removed 26 redundant places. [2025-03-13 21:52:20,432 INFO L231 Difference]: Finished difference. Result has 389 places, 698 transitions, 9716 flow [2025-03-13 21:52:20,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=6718, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=393, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=76, PETRI_FLOW=9716, PETRI_PLACES=389, PETRI_TRANSITIONS=698} [2025-03-13 21:52:20,433 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 351 predicate places. [2025-03-13 21:52:20,433 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 698 transitions, 9716 flow [2025-03-13 21:52:20,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 8.512820512820513) internal successors, (332), 39 states have internal predecessors, (332), 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-13 21:52:20,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:20,433 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:20,439 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-13 21:52:20,638 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,SelfDestructingSolverStorable13 [2025-03-13 21:52:20,638 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:52:20,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:20,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1274187839, now seen corresponding path program 3 times [2025-03-13 21:52:20,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:20,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99232308] [2025-03-13 21:52:20,639 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:52:20,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:20,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-03-13 21:52:20,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 40 statements. [2025-03-13 21:52:20,668 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:52:20,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:20,978 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:52:20,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:20,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99232308] [2025-03-13 21:52:20,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99232308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:20,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843169350] [2025-03-13 21:52:20,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:52:20,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:20,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:20,980 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-13 21:52:20,982 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-13 21:52:21,030 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-03-13 21:52:21,055 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 40 statements. [2025-03-13 21:52:21,055 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:52:21,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:21,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-13 21:52:21,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:52:21,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:21,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:52:21,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-03-13 21:52:21,760 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:52:21,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843169350] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:52:21,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:52:21,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 28 [2025-03-13 21:52:21,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418432776] [2025-03-13 21:52:21,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:52:21,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-13 21:52:21,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:21,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-13 21:52:21,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2025-03-13 21:52:21,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2025-03-13 21:52:21,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 698 transitions, 9716 flow. Second operand has 29 states, 29 states have (on average 9.275862068965518) internal successors, (269), 29 states have internal predecessors, (269), 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-13 21:52:21,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:21,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2025-03-13 21:52:21,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand