./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.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 a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:04:49,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:04:49,634 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:04:49,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:04:49,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:04:49,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:04:49,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:04:49,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:04:49,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:04:49,654 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:04:49,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:04:49,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:04:49,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:04:49,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:04:49,654 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:04:49,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:04:49,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:04:49,656 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:04:49,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:04:49,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:04:49,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:04:49,656 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:04:49,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:04:49,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:04:49,656 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:04:49,656 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:04:49,656 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:04:49,656 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:04:49,657 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:04:49,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:04:49,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:04:49,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:04:49,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:04:49,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:04:49,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:04:49,657 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:04:49,658 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:04:49,658 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:04:49,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:04:49,658 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:04:49,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:04:49,658 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:04:49,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:04:49,658 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 -> a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 [2025-03-14 01:04:50,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:04:50,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:04:50,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:04:50,041 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:04:50,041 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:04:50,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2025-03-14 01:04:51,214 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77a8cf0ff/b83a3c6449bb46fa9926e09e36493836/FLAGb9e9d4b1b [2025-03-14 01:04:51,421 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:04:51,422 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2025-03-14 01:04:51,449 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77a8cf0ff/b83a3c6449bb46fa9926e09e36493836/FLAGb9e9d4b1b [2025-03-14 01:04:51,766 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77a8cf0ff/b83a3c6449bb46fa9926e09e36493836 [2025-03-14 01:04:51,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:04:51,769 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:04:51,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:04:51,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:04:51,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:04:51,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:04:51" (1/1) ... [2025-03-14 01:04:51,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f65a6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:51, skipping insertion in model container [2025-03-14 01:04:51,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:04:51" (1/1) ... [2025-03-14 01:04:51,792 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:04:51,919 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-bad-buffer-mult-alt2.wvr.c[4226,4239] [2025-03-14 01:04:51,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:04:51,938 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:04:51,963 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-bad-buffer-mult-alt2.wvr.c[4226,4239] [2025-03-14 01:04:51,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:04:51,984 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:04:51,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:51 WrapperNode [2025-03-14 01:04:51,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:04:51,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:04:51,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:04:51,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:04:51,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:51" (1/1) ... [2025-03-14 01:04:51,996 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:51" (1/1) ... [2025-03-14 01:04:52,022 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 289 [2025-03-14 01:04:52,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:04:52,025 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:04:52,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:04:52,026 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:04:52,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:51" (1/1) ... [2025-03-14 01:04:52,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:51" (1/1) ... [2025-03-14 01:04:52,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:51" (1/1) ... [2025-03-14 01:04:52,060 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-14 01:04:52,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:51" (1/1) ... [2025-03-14 01:04:52,062 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:51" (1/1) ... [2025-03-14 01:04:52,072 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:51" (1/1) ... [2025-03-14 01:04:52,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:51" (1/1) ... [2025-03-14 01:04:52,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:51" (1/1) ... [2025-03-14 01:04:52,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:51" (1/1) ... [2025-03-14 01:04:52,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:04:52,077 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:04:52,077 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:04:52,078 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:04:52,078 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:51" (1/1) ... [2025-03-14 01:04:52,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:04:52,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:04:52,104 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:04:52,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:04:52,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:04:52,124 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:04:52,124 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:04:52,124 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:04:52,124 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:04:52,124 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:04:52,124 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:04:52,124 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-14 01:04:52,124 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-14 01:04:52,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:04:52,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 01:04:52,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 01:04:52,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 01:04:52,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:04:52,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:04:52,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:04:52,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:04:52,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:04:52,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 01:04:52,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 01:04:52,126 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:04:52,223 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:04:52,225 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:04:52,674 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:04:52,675 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:04:52,675 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:04:53,012 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:04:53,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:04:53 BoogieIcfgContainer [2025-03-14 01:04:53,013 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:04:53,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:04:53,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:04:53,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:04:53,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:04:51" (1/3) ... [2025-03-14 01:04:53,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c75cb86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:04:53, skipping insertion in model container [2025-03-14 01:04:53,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:04:51" (2/3) ... [2025-03-14 01:04:53,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c75cb86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:04:53, skipping insertion in model container [2025-03-14 01:04:53,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:04:53" (3/3) ... [2025-03-14 01:04:53,021 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2025-03-14 01:04:53,033 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:04:53,035 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt2.wvr.c that has 5 procedures, 43 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-14 01:04:53,035 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:04:53,111 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-14 01:04:53,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 48 transitions, 124 flow [2025-03-14 01:04:53,161 INFO L124 PetriNetUnfolderBase]: 6/44 cut-off events. [2025-03-14 01:04:53,167 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:04:53,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 44 events. 6/44 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-03-14 01:04:53,175 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 48 transitions, 124 flow [2025-03-14 01:04:53,178 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 43 transitions, 110 flow [2025-03-14 01:04:53,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:04:53,196 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;@4b41eb9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:04:53,197 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-14 01:04:53,210 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:04:53,211 INFO L124 PetriNetUnfolderBase]: 6/42 cut-off events. [2025-03-14 01:04:53,211 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:04:53,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:53,212 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:04:53,212 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 2 more)] === [2025-03-14 01:04:53,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:53,216 INFO L85 PathProgramCache]: Analyzing trace with hash -417808382, now seen corresponding path program 1 times [2025-03-14 01:04:53,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:53,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700130530] [2025-03-14 01:04:53,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:04:53,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:53,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-14 01:04:53,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 01:04:53,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:04:53,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:53,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:04:53,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:53,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700130530] [2025-03-14 01:04:53,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700130530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:04:53,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:04:53,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:04:53,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533280336] [2025-03-14 01:04:53,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:04:53,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:04:53,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:53,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:04:53,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:04:53,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-14 01:04:53,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:53,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:53,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-14 01:04:53,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:54,643 INFO L124 PetriNetUnfolderBase]: 4371/6150 cut-off events. [2025-03-14 01:04:54,644 INFO L125 PetriNetUnfolderBase]: For 468/468 co-relation queries the response was YES. [2025-03-14 01:04:54,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12327 conditions, 6150 events. 4371/6150 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 31796 event pairs, 560 based on Foata normal form. 280/6387 useless extension candidates. Maximal degree in co-relation 10885. Up to 3269 conditions per place. [2025-03-14 01:04:54,710 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 84 selfloop transitions, 7 changer transitions 0/100 dead transitions. [2025-03-14 01:04:54,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 100 transitions, 439 flow [2025-03-14 01:04:54,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:04:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:04:54,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2025-03-14 01:04:54,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-03-14 01:04:54,722 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 110 flow. Second operand 6 states and 171 transitions. [2025-03-14 01:04:54,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 100 transitions, 439 flow [2025-03-14 01:04:54,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 100 transitions, 401 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-14 01:04:54,736 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 141 flow [2025-03-14 01:04:54,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2025-03-14 01:04:54,740 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2025-03-14 01:04:54,741 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 141 flow [2025-03-14 01:04:54,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:54,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:54,742 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, 1, 1] [2025-03-14 01:04:54,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:04:54,742 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 2 more)] === [2025-03-14 01:04:54,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:54,743 INFO L85 PathProgramCache]: Analyzing trace with hash -2106354126, now seen corresponding path program 1 times [2025-03-14 01:04:54,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:54,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154427889] [2025-03-14 01:04:54,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:04:54,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:54,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-14 01:04:54,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-14 01:04:54,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:04:54,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:54,968 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-14 01:04:54,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:54,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154427889] [2025-03-14 01:04:54,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154427889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:04:54,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:04:54,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:04:54,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231460050] [2025-03-14 01:04:54,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:04:54,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:04:54,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:54,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:04:54,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:04:54,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-14 01:04:54,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:54,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:54,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-14 01:04:54,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:55,635 INFO L124 PetriNetUnfolderBase]: 5126/7119 cut-off events. [2025-03-14 01:04:55,636 INFO L125 PetriNetUnfolderBase]: For 3909/3909 co-relation queries the response was YES. [2025-03-14 01:04:55,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16981 conditions, 7119 events. 5126/7119 cut-off events. For 3909/3909 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 37462 event pairs, 3571 based on Foata normal form. 217/7174 useless extension candidates. Maximal degree in co-relation 9462. Up to 5721 conditions per place. [2025-03-14 01:04:55,680 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 38 selfloop transitions, 2 changer transitions 26/75 dead transitions. [2025-03-14 01:04:55,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 75 transitions, 343 flow [2025-03-14 01:04:55,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:04:55,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:04:55,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-03-14 01:04:55,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-14 01:04:55,684 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 141 flow. Second operand 5 states and 128 transitions. [2025-03-14 01:04:55,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 75 transitions, 343 flow [2025-03-14 01:04:55,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 75 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:04:55,691 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 158 flow [2025-03-14 01:04:55,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2025-03-14 01:04:55,694 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2025-03-14 01:04:55,694 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 158 flow [2025-03-14 01:04:55,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:55,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:55,695 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, 1, 1, 1] [2025-03-14 01:04:55,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:04:55,696 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 2 more)] === [2025-03-14 01:04:55,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:55,697 INFO L85 PathProgramCache]: Analyzing trace with hash 334936313, now seen corresponding path program 1 times [2025-03-14 01:04:55,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:55,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687890963] [2025-03-14 01:04:55,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:04:55,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:55,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-14 01:04:55,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-14 01:04:55,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:04:55,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:04:55,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:55,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687890963] [2025-03-14 01:04:55,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687890963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:04:55,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:04:55,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:04:55,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716639659] [2025-03-14 01:04:55,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:04:55,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:04:55,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:55,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:04:55,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:04:55,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-14 01:04:55,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:55,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:55,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-14 01:04:55,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:56,850 INFO L124 PetriNetUnfolderBase]: 7623/10626 cut-off events. [2025-03-14 01:04:56,850 INFO L125 PetriNetUnfolderBase]: For 4893/4893 co-relation queries the response was YES. [2025-03-14 01:04:56,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25109 conditions, 10626 events. 7623/10626 cut-off events. For 4893/4893 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 58719 event pairs, 2380 based on Foata normal form. 140/10644 useless extension candidates. Maximal degree in co-relation 25093. Up to 4594 conditions per place. [2025-03-14 01:04:56,909 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 91 selfloop transitions, 11 changer transitions 0/111 dead transitions. [2025-03-14 01:04:56,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 111 transitions, 527 flow [2025-03-14 01:04:56,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:04:56,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:04:56,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2025-03-14 01:04:56,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6076388888888888 [2025-03-14 01:04:56,913 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 158 flow. Second operand 6 states and 175 transitions. [2025-03-14 01:04:56,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 111 transitions, 527 flow [2025-03-14 01:04:56,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 111 transitions, 513 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-14 01:04:56,920 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 233 flow [2025-03-14 01:04:56,920 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2025-03-14 01:04:56,921 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2025-03-14 01:04:56,921 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 233 flow [2025-03-14 01:04:56,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:56,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:56,922 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, 1, 1, 1] [2025-03-14 01:04:56,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:04:56,922 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 2 more)] === [2025-03-14 01:04:56,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:56,923 INFO L85 PathProgramCache]: Analyzing trace with hash -307235721, now seen corresponding path program 1 times [2025-03-14 01:04:56,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:56,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681247168] [2025-03-14 01:04:56,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:04:56,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:56,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-14 01:04:56,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-14 01:04:56,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:04:56,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:04:57,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:57,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681247168] [2025-03-14 01:04:57,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681247168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:04:57,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:04:57,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:04:57,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87861491] [2025-03-14 01:04:57,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:04:57,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:04:57,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:57,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:04:57,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:04:57,019 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-14 01:04:57,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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-14 01:04:57,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:57,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-14 01:04:57,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:04:57,735 INFO L124 PetriNetUnfolderBase]: 6939/9719 cut-off events. [2025-03-14 01:04:57,735 INFO L125 PetriNetUnfolderBase]: For 12459/12459 co-relation queries the response was YES. [2025-03-14 01:04:57,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26951 conditions, 9719 events. 6939/9719 cut-off events. For 12459/12459 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 52105 event pairs, 1361 based on Foata normal form. 128/9781 useless extension candidates. Maximal degree in co-relation 26929. Up to 8052 conditions per place. [2025-03-14 01:04:57,806 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 58 selfloop transitions, 3 changer transitions 3/73 dead transitions. [2025-03-14 01:04:57,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 396 flow [2025-03-14 01:04:57,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:04:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:04:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2025-03-14 01:04:57,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6527777777777778 [2025-03-14 01:04:57,808 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 233 flow. Second operand 3 states and 94 transitions. [2025-03-14 01:04:57,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 396 flow [2025-03-14 01:04:57,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 73 transitions, 389 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-14 01:04:57,824 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 226 flow [2025-03-14 01:04:57,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2025-03-14 01:04:57,825 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2025-03-14 01:04:57,825 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 226 flow [2025-03-14 01:04:57,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 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-14 01:04:57,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:04:57,825 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, 1, 1, 1, 1, 1, 1] [2025-03-14 01:04:57,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:04:57,826 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 2 more)] === [2025-03-14 01:04:57,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:04:57,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1996026671, now seen corresponding path program 1 times [2025-03-14 01:04:57,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:04:57,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112971937] [2025-03-14 01:04:57,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:04:57,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:04:57,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:04:57,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:04:57,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:04:57,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:58,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:04:58,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:04:58,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112971937] [2025-03-14 01:04:58,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112971937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:04:58,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293146762] [2025-03-14 01:04:58,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:04:58,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:04:58,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:04:58,778 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:04:58,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:04:58,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-14 01:04:58,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-14 01:04:58,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:04:58,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:04:58,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-14 01:04:58,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:04:58,961 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-14 01:04:59,269 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 15 treesize of output 7 [2025-03-14 01:04:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:04:59,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:04:59,824 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 39 treesize of output 35 [2025-03-14 01:04:59,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2025-03-14 01:04:59,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:04:59,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293146762] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:04:59,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:04:59,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-14 01:04:59,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517520122] [2025-03-14 01:04:59,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:04:59,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 01:04:59,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:04:59,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 01:04:59,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:04:59,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-14 01:04:59,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 226 flow. Second operand has 18 states, 18 states have (on average 17.055555555555557) internal successors, (307), 18 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:04:59,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:04:59,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-14 01:04:59,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:04,176 INFO L124 PetriNetUnfolderBase]: 34831/49425 cut-off events. [2025-03-14 01:05:04,176 INFO L125 PetriNetUnfolderBase]: For 68394/68394 co-relation queries the response was YES. [2025-03-14 01:05:04,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135014 conditions, 49425 events. 34831/49425 cut-off events. For 68394/68394 co-relation queries the response was YES. Maximal size of possible extension queue 1545. Compared 327351 event pairs, 4146 based on Foata normal form. 426/49670 useless extension candidates. Maximal degree in co-relation 75380. Up to 11426 conditions per place. [2025-03-14 01:05:04,521 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 344 selfloop transitions, 68 changer transitions 24/445 dead transitions. [2025-03-14 01:05:04,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 445 transitions, 2568 flow [2025-03-14 01:05:04,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-14 01:05:04,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-14 01:05:04,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 684 transitions. [2025-03-14 01:05:04,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6195652173913043 [2025-03-14 01:05:04,525 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 226 flow. Second operand 23 states and 684 transitions. [2025-03-14 01:05:04,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 445 transitions, 2568 flow [2025-03-14 01:05:04,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 445 transitions, 2532 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:05:04,810 INFO L231 Difference]: Finished difference. Result has 88 places, 123 transitions, 850 flow [2025-03-14 01:05:04,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=850, PETRI_PLACES=88, PETRI_TRANSITIONS=123} [2025-03-14 01:05:04,811 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 38 predicate places. [2025-03-14 01:05:04,811 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 123 transitions, 850 flow [2025-03-14 01:05:04,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 17.055555555555557) internal successors, (307), 18 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:04,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:04,812 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:05:04,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:05:05,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:05:05,013 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 2 more)] === [2025-03-14 01:05:05,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:05,014 INFO L85 PathProgramCache]: Analyzing trace with hash 828509554, now seen corresponding path program 1 times [2025-03-14 01:05:05,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:05,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778064307] [2025-03-14 01:05:05,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:05,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:05,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-14 01:05:05,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:05:05,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:05,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:05:05,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:05,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778064307] [2025-03-14 01:05:05,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778064307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:05:05,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282789071] [2025-03-14 01:05:05,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:05,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:05:05,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:05:05,761 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:05:05,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:05:05,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-14 01:05:05,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-14 01:05:05,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:05,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:05,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-14 01:05:05,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:05:06,048 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 25 treesize of output 7 [2025-03-14 01:05:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:05:06,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:05:06,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:05:06,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-03-14 01:05:06,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:05:06,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282789071] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:05:06,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:05:06,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2025-03-14 01:05:06,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18989616] [2025-03-14 01:05:06,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:05:06,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 01:05:06,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:06,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 01:05:06,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-14 01:05:06,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-14 01:05:06,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 123 transitions, 850 flow. Second operand has 14 states, 14 states have (on average 18.214285714285715) internal successors, (255), 14 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:06,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:06,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-14 01:05:06,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:13,205 INFO L124 PetriNetUnfolderBase]: 59364/84128 cut-off events. [2025-03-14 01:05:13,205 INFO L125 PetriNetUnfolderBase]: For 203076/203076 co-relation queries the response was YES. [2025-03-14 01:05:13,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256834 conditions, 84128 events. 59364/84128 cut-off events. For 203076/203076 co-relation queries the response was YES. Maximal size of possible extension queue 2694. Compared 593107 event pairs, 7000 based on Foata normal form. 3/83813 useless extension candidates. Maximal degree in co-relation 215738. Up to 29816 conditions per place. [2025-03-14 01:05:14,061 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 235 selfloop transitions, 105 changer transitions 11/360 dead transitions. [2025-03-14 01:05:14,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 360 transitions, 2599 flow [2025-03-14 01:05:14,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 01:05:14,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 01:05:14,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 462 transitions. [2025-03-14 01:05:14,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5661764705882353 [2025-03-14 01:05:14,064 INFO L175 Difference]: Start difference. First operand has 88 places, 123 transitions, 850 flow. Second operand 17 states and 462 transitions. [2025-03-14 01:05:14,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 360 transitions, 2599 flow [2025-03-14 01:05:14,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 360 transitions, 2559 flow, removed 19 selfloop flow, removed 1 redundant places. [2025-03-14 01:05:14,651 INFO L231 Difference]: Finished difference. Result has 110 places, 180 transitions, 1662 flow [2025-03-14 01:05:14,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1662, PETRI_PLACES=110, PETRI_TRANSITIONS=180} [2025-03-14 01:05:14,651 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 60 predicate places. [2025-03-14 01:05:14,651 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 180 transitions, 1662 flow [2025-03-14 01:05:14,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.214285714285715) internal successors, (255), 14 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:14,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:14,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:05:14,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 01:05:14,852 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,SelfDestructingSolverStorable5 [2025-03-14 01:05:14,852 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 2 more)] === [2025-03-14 01:05:14,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:14,853 INFO L85 PathProgramCache]: Analyzing trace with hash -110538083, now seen corresponding path program 1 times [2025-03-14 01:05:14,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:14,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695069015] [2025-03-14 01:05:14,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:14,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:14,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-14 01:05:14,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-14 01:05:14,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:14,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:14,939 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-14 01:05:14,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:14,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695069015] [2025-03-14 01:05:14,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695069015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:14,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:14,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:05:14,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844143637] [2025-03-14 01:05:14,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:14,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:05:14,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:14,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:05:14,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:05:14,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-14 01:05:14,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 180 transitions, 1662 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:14,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:14,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-14 01:05:14,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:05:25,045 INFO L124 PetriNetUnfolderBase]: 76734/109805 cut-off events. [2025-03-14 01:05:25,046 INFO L125 PetriNetUnfolderBase]: For 486757/486757 co-relation queries the response was YES. [2025-03-14 01:05:25,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366071 conditions, 109805 events. 76734/109805 cut-off events. For 486757/486757 co-relation queries the response was YES. Maximal size of possible extension queue 3461. Compared 815953 event pairs, 27628 based on Foata normal form. 2355/111571 useless extension candidates. Maximal degree in co-relation 360388. Up to 62347 conditions per place. [2025-03-14 01:05:26,184 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 252 selfloop transitions, 8 changer transitions 0/269 dead transitions. [2025-03-14 01:05:26,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 269 transitions, 3185 flow [2025-03-14 01:05:26,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:05:26,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:05:26,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-03-14 01:05:26,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-14 01:05:26,185 INFO L175 Difference]: Start difference. First operand has 110 places, 180 transitions, 1662 flow. Second operand 3 states and 96 transitions. [2025-03-14 01:05:26,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 269 transitions, 3185 flow [2025-03-14 01:05:28,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 269 transitions, 3040 flow, removed 70 selfloop flow, removed 2 redundant places. [2025-03-14 01:05:28,120 INFO L231 Difference]: Finished difference. Result has 111 places, 181 transitions, 1669 flow [2025-03-14 01:05:28,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1581, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1669, PETRI_PLACES=111, PETRI_TRANSITIONS=181} [2025-03-14 01:05:28,124 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 61 predicate places. [2025-03-14 01:05:28,124 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 181 transitions, 1669 flow [2025-03-14 01:05:28,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:28,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:05:28,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:05:28,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:05:28,125 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 2 more)] === [2025-03-14 01:05:28,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:05:28,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1997478231, now seen corresponding path program 1 times [2025-03-14 01:05:28,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:05:28,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109224028] [2025-03-14 01:05:28,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:05:28,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:05:28,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-14 01:05:28,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-14 01:05:28,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:05:28,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:05:28,244 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-14 01:05:28,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:05:28,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109224028] [2025-03-14 01:05:28,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109224028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:05:28,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:05:28,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 01:05:28,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081204727] [2025-03-14 01:05:28,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:05:28,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:05:28,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:05:28,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:05:28,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:05:28,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-14 01:05:28,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 181 transitions, 1669 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:05:28,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:05:28,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-14 01:05:28,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand