./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 613bf9314e4e3fb6e64527ec38c7e6b39400e524de37a5103e9f06d9db406d3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:46:06,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:46:06,995 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:46:07,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:46:07,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:46:07,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:46:07,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:46:07,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:46:07,033 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:46:07,033 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:46:07,034 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:46:07,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:46:07,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:46:07,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:46:07,034 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:46:07,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:46:07,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:46:07,035 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:46:07,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:46:07,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:46:07,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:46:07,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:46:07,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:46:07,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:46:07,036 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:46:07,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:46:07,036 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:46:07,037 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:46:07,037 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:46:07,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:46:07,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:46:07,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:46:07,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:46:07,038 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:46:07,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:46:07,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:46:07,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:46:07,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:46:07,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:46:07,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:46:07,039 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:46:07,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:46:07,039 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:46:07,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:46:07,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:46:07,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:46:07,039 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:46:07,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:46:07,039 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-jdk21/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 -> 613bf9314e4e3fb6e64527ec38c7e6b39400e524de37a5103e9f06d9db406d3d [2025-01-09 16:46:07,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:46:07,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:46:07,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:46:07,364 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:46:07,365 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:46:07,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c [2025-01-09 16:46:08,716 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8096807c1/853ff110cdd14acca5096b0c1eb540f7/FLAG978c74658 [2025-01-09 16:46:08,954 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:46:08,955 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c [2025-01-09 16:46:08,961 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8096807c1/853ff110cdd14acca5096b0c1eb540f7/FLAG978c74658 [2025-01-09 16:46:08,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8096807c1/853ff110cdd14acca5096b0c1eb540f7 [2025-01-09 16:46:08,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:46:08,977 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:46:08,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:46:08,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:46:08,981 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:46:08,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:46:08" (1/1) ... [2025-01-09 16:46:08,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42d6762f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:08, skipping insertion in model container [2025-01-09 16:46:08,983 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:46:08" (1/1) ... [2025-01-09 16:46:09,000 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:46:09,172 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c[2896,2909] [2025-01-09 16:46:09,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:46:09,195 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:46:09,217 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c[2896,2909] [2025-01-09 16:46:09,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:46:09,241 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:46:09,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:09 WrapperNode [2025-01-09 16:46:09,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:46:09,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:46:09,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:46:09,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:46:09,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:09" (1/1) ... [2025-01-09 16:46:09,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:09" (1/1) ... [2025-01-09 16:46:09,284 INFO L138 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 150 [2025-01-09 16:46:09,285 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:46:09,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:46:09,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:46:09,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:46:09,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:09" (1/1) ... [2025-01-09 16:46:09,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:09" (1/1) ... [2025-01-09 16:46:09,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:09" (1/1) ... [2025-01-09 16:46:09,319 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-09 16:46:09,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:09" (1/1) ... [2025-01-09 16:46:09,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:09" (1/1) ... [2025-01-09 16:46:09,328 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:09" (1/1) ... [2025-01-09 16:46:09,333 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:09" (1/1) ... [2025-01-09 16:46:09,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:09" (1/1) ... [2025-01-09 16:46:09,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:09" (1/1) ... [2025-01-09 16:46:09,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:09" (1/1) ... [2025-01-09 16:46:09,343 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:46:09,347 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:46:09,347 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:46:09,347 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:46:09,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:09" (1/1) ... [2025-01-09 16:46:09,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:46:09,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:09,382 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:46:09,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:46:09,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:46:09,406 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:46:09,406 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:46:09,406 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:46:09,406 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:46:09,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:46:09,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:46:09,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:46:09,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:46:09,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:46:09,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:46:09,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:46:09,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:46:09,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:46:09,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:46:09,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:46:09,408 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:46:09,482 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:46:09,484 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:46:09,709 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:46:09,710 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:46:09,929 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:46:09,930 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:46:09,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:46:09 BoogieIcfgContainer [2025-01-09 16:46:09,932 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:46:09,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:46:09,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:46:09,938 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:46:09,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:46:08" (1/3) ... [2025-01-09 16:46:09,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7c3b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:46:09, skipping insertion in model container [2025-01-09 16:46:09,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:46:09" (2/3) ... [2025-01-09 16:46:09,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7c3b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:46:09, skipping insertion in model container [2025-01-09 16:46:09,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:46:09" (3/3) ... [2025-01-09 16:46:09,941 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2025-01-09 16:46:09,959 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:46:09,960 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-2-nl.wvr.c that has 3 procedures, 25 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-09 16:46:09,960 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:46:10,025 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:46:10,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 28 transitions, 70 flow [2025-01-09 16:46:10,089 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-01-09 16:46:10,093 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:46:10,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 4/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-01-09 16:46:10,095 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 28 transitions, 70 flow [2025-01-09 16:46:10,098 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 25 transitions, 62 flow [2025-01-09 16:46:10,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:46:10,118 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;@692f3edb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:46:10,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:46:10,133 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:46:10,133 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-01-09 16:46:10,133 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:46:10,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:10,134 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:10,134 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:46:10,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:10,141 INFO L85 PathProgramCache]: Analyzing trace with hash -699549830, now seen corresponding path program 1 times [2025-01-09 16:46:10,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:10,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275212574] [2025-01-09 16:46:10,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:46:10,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:10,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 16:46:10,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:46:10,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:10,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:10,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:10,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:10,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275212574] [2025-01-09 16:46:10,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275212574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:10,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:10,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:46:10,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356539924] [2025-01-09 16:46:10,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:10,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:46:10,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:10,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:46:10,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:46:10,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2025-01-09 16:46:10,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 25 transitions, 62 flow. Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-01-09 16:46:10,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:10,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2025-01-09 16:46:10,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:10,500 INFO L124 PetriNetUnfolderBase]: 108/203 cut-off events. [2025-01-09 16:46:10,500 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-09 16:46:10,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 203 events. 108/203 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 620 event pairs, 83 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 361. Up to 178 conditions per place. [2025-01-09 16:46:10,508 INFO L140 encePairwiseOnDemand]: 27/28 looper letters, 20 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2025-01-09 16:46:10,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 24 transitions, 100 flow [2025-01-09 16:46:10,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:46:10,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 16:46:10,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2025-01-09 16:46:10,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2025-01-09 16:46:10,524 INFO L175 Difference]: Start difference. First operand has 28 places, 25 transitions, 62 flow. Second operand 2 states and 33 transitions. [2025-01-09 16:46:10,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 24 transitions, 100 flow [2025-01-09 16:46:10,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 24 transitions, 92 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 16:46:10,530 INFO L231 Difference]: Finished difference. Result has 25 places, 24 transitions, 52 flow [2025-01-09 16:46:10,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=25, PETRI_TRANSITIONS=24} [2025-01-09 16:46:10,536 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, -3 predicate places. [2025-01-09 16:46:10,537 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 24 transitions, 52 flow [2025-01-09 16:46:10,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-01-09 16:46:10,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:10,537 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:10,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:46:10,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:46:10,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:10,539 INFO L85 PathProgramCache]: Analyzing trace with hash 946895884, now seen corresponding path program 1 times [2025-01-09 16:46:10,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:10,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637007333] [2025-01-09 16:46:10,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:46:10,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:10,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 16:46:10,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:46:10,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:10,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:10,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:10,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637007333] [2025-01-09 16:46:10,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637007333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:10,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:10,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:46:10,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751154483] [2025-01-09 16:46:10,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:10,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:46:10,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:10,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:46:10,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:46:10,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2025-01-09 16:46:10,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 24 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:10,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:10,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2025-01-09 16:46:10,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:10,928 INFO L124 PetriNetUnfolderBase]: 121/237 cut-off events. [2025-01-09 16:46:10,928 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:46:10,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 237 events. 121/237 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 772 event pairs, 96 based on Foata normal form. 17/239 useless extension candidates. Maximal degree in co-relation 458. Up to 178 conditions per place. [2025-01-09 16:46:10,931 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 19 selfloop transitions, 2 changer transitions 8/33 dead transitions. [2025-01-09 16:46:10,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 33 transitions, 130 flow [2025-01-09 16:46:10,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:46:10,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:46:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-01-09 16:46:10,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-09 16:46:10,933 INFO L175 Difference]: Start difference. First operand has 25 places, 24 transitions, 52 flow. Second operand 4 states and 56 transitions. [2025-01-09 16:46:10,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 33 transitions, 130 flow [2025-01-09 16:46:10,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:46:10,936 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 70 flow [2025-01-09 16:46:10,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2025-01-09 16:46:10,938 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2025-01-09 16:46:10,938 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 70 flow [2025-01-09 16:46:10,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:10,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:10,939 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:10,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:46:10,939 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:46:10,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:10,940 INFO L85 PathProgramCache]: Analyzing trace with hash -304062500, now seen corresponding path program 1 times [2025-01-09 16:46:10,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:10,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945213329] [2025-01-09 16:46:10,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:46:10,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:10,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:46:10,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:46:10,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:10,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:11,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:11,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:11,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945213329] [2025-01-09 16:46:11,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945213329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:11,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:11,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:46:11,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862497569] [2025-01-09 16:46:11,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:11,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:46:11,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:11,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:46:11,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:46:11,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:46:11,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 70 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-01-09 16:46:11,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:11,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:46:11,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:11,967 INFO L124 PetriNetUnfolderBase]: 205/380 cut-off events. [2025-01-09 16:46:11,967 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-01-09 16:46:11,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 380 events. 205/380 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1483 event pairs, 5 based on Foata normal form. 1/380 useless extension candidates. Maximal degree in co-relation 824. Up to 227 conditions per place. [2025-01-09 16:46:11,971 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 44 selfloop transitions, 14 changer transitions 5/66 dead transitions. [2025-01-09 16:46:11,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 66 transitions, 303 flow [2025-01-09 16:46:11,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:46:11,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:46:11,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2025-01-09 16:46:11,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4035714285714286 [2025-01-09 16:46:11,972 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 70 flow. Second operand 10 states and 113 transitions. [2025-01-09 16:46:11,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 66 transitions, 303 flow [2025-01-09 16:46:11,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 66 transitions, 299 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:46:11,974 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 151 flow [2025-01-09 16:46:11,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=151, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-01-09 16:46:11,975 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 14 predicate places. [2025-01-09 16:46:11,977 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 151 flow [2025-01-09 16:46:11,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-01-09 16:46:11,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:11,977 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:11,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:46:11,977 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:46:11,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:11,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1420153160, now seen corresponding path program 2 times [2025-01-09 16:46:11,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:11,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114369113] [2025-01-09 16:46:11,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:46:11,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:11,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-09 16:46:12,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-01-09 16:46:12,001 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:46:12,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:12,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:12,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:12,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114369113] [2025-01-09 16:46:12,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114369113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:12,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:12,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:46:12,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682257328] [2025-01-09 16:46:12,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:12,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:46:12,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:12,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:46:12,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:46:12,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2025-01-09 16:46:12,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-01-09 16:46:12,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:12,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2025-01-09 16:46:12,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:12,115 INFO L124 PetriNetUnfolderBase]: 151/292 cut-off events. [2025-01-09 16:46:12,115 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-01-09 16:46:12,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 292 events. 151/292 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1037 event pairs, 33 based on Foata normal form. 8/299 useless extension candidates. Maximal degree in co-relation 811. Up to 224 conditions per place. [2025-01-09 16:46:12,118 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 35 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2025-01-09 16:46:12,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 242 flow [2025-01-09 16:46:12,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:46:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:46:12,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-01-09 16:46:12,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2025-01-09 16:46:12,120 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 151 flow. Second operand 3 states and 46 transitions. [2025-01-09 16:46:12,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 242 flow [2025-01-09 16:46:12,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 232 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-01-09 16:46:12,122 INFO L231 Difference]: Finished difference. Result has 40 places, 37 transitions, 155 flow [2025-01-09 16:46:12,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=40, PETRI_TRANSITIONS=37} [2025-01-09 16:46:12,123 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 12 predicate places. [2025-01-09 16:46:12,123 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 155 flow [2025-01-09 16:46:12,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-01-09 16:46:12,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:12,123 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:12,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:46:12,124 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:46:12,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:12,124 INFO L85 PathProgramCache]: Analyzing trace with hash 446926800, now seen corresponding path program 3 times [2025-01-09 16:46:12,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:12,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336186101] [2025-01-09 16:46:12,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:46:12,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:12,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-01-09 16:46:12,142 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-01-09 16:46:12,143 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:46:12,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:12,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:12,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336186101] [2025-01-09 16:46:12,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336186101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:12,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:12,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:46:12,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813556026] [2025-01-09 16:46:12,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:12,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:46:12,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:12,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:46:12,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:46:12,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:46:12,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 155 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-01-09 16:46:12,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:12,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:46:12,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:12,880 INFO L124 PetriNetUnfolderBase]: 193/372 cut-off events. [2025-01-09 16:46:12,880 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-01-09 16:46:12,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 372 events. 193/372 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1470 event pairs, 25 based on Foata normal form. 1/372 useless extension candidates. Maximal degree in co-relation 1123. Up to 226 conditions per place. [2025-01-09 16:46:12,886 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 44 selfloop transitions, 18 changer transitions 5/70 dead transitions. [2025-01-09 16:46:12,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 70 transitions, 431 flow [2025-01-09 16:46:12,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:46:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:46:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2025-01-09 16:46:12,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-01-09 16:46:12,891 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 155 flow. Second operand 10 states and 112 transitions. [2025-01-09 16:46:12,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 70 transitions, 431 flow [2025-01-09 16:46:12,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 70 transitions, 400 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-01-09 16:46:12,897 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 237 flow [2025-01-09 16:46:12,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=237, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2025-01-09 16:46:12,898 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 23 predicate places. [2025-01-09 16:46:12,900 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 237 flow [2025-01-09 16:46:12,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-01-09 16:46:12,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:12,900 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:12,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:46:12,900 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:46:12,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:12,901 INFO L85 PathProgramCache]: Analyzing trace with hash 119108534, now seen corresponding path program 4 times [2025-01-09 16:46:12,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:12,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456076164] [2025-01-09 16:46:12,901 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:46:12,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:12,911 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-01-09 16:46:12,934 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:46:12,939 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:46:12,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:13,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:13,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456076164] [2025-01-09 16:46:13,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456076164] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:13,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:13,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:46:13,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937067523] [2025-01-09 16:46:13,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:13,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:46:13,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:13,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:46:13,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:46:13,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-01-09 16:46:13,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 237 flow. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:13,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:13,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-01-09 16:46:13,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:13,650 INFO L124 PetriNetUnfolderBase]: 228/430 cut-off events. [2025-01-09 16:46:13,650 INFO L125 PetriNetUnfolderBase]: For 468/468 co-relation queries the response was YES. [2025-01-09 16:46:13,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1380 conditions, 430 events. 228/430 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1704 event pairs, 34 based on Foata normal form. 1/431 useless extension candidates. Maximal degree in co-relation 1366. Up to 273 conditions per place. [2025-01-09 16:46:13,654 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 52 selfloop transitions, 22 changer transitions 5/81 dead transitions. [2025-01-09 16:46:13,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 81 transitions, 550 flow [2025-01-09 16:46:13,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:46:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:46:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2025-01-09 16:46:13,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-01-09 16:46:13,655 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 237 flow. Second operand 10 states and 110 transitions. [2025-01-09 16:46:13,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 81 transitions, 550 flow [2025-01-09 16:46:13,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 81 transitions, 515 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-09 16:46:13,660 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 339 flow [2025-01-09 16:46:13,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=339, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2025-01-09 16:46:13,660 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 32 predicate places. [2025-01-09 16:46:13,660 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 339 flow [2025-01-09 16:46:13,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:13,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:13,661 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:13,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:46:13,661 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:46:13,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:13,661 INFO L85 PathProgramCache]: Analyzing trace with hash -24465424, now seen corresponding path program 5 times [2025-01-09 16:46:13,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:13,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035226700] [2025-01-09 16:46:13,662 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:46:13,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:13,670 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-09 16:46:13,686 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:46:13,689 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:13,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:14,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:14,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:14,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035226700] [2025-01-09 16:46:14,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035226700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:14,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:14,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:46:14,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472923757] [2025-01-09 16:46:14,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:14,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:46:14,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:14,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:46:14,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:46:14,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:46:14,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 339 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-01-09 16:46:14,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:14,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:46:14,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:14,374 INFO L124 PetriNetUnfolderBase]: 206/417 cut-off events. [2025-01-09 16:46:14,374 INFO L125 PetriNetUnfolderBase]: For 832/832 co-relation queries the response was YES. [2025-01-09 16:46:14,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 417 events. 206/417 cut-off events. For 832/832 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1819 event pairs, 16 based on Foata normal form. 1/416 useless extension candidates. Maximal degree in co-relation 1484. Up to 223 conditions per place. [2025-01-09 16:46:14,380 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 50 selfloop transitions, 27 changer transitions 5/85 dead transitions. [2025-01-09 16:46:14,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 644 flow [2025-01-09 16:46:14,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:46:14,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:46:14,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2025-01-09 16:46:14,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3961038961038961 [2025-01-09 16:46:14,382 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 339 flow. Second operand 11 states and 122 transitions. [2025-01-09 16:46:14,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 644 flow [2025-01-09 16:46:14,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 85 transitions, 630 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-01-09 16:46:14,391 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 429 flow [2025-01-09 16:46:14,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=429, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2025-01-09 16:46:14,393 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 44 predicate places. [2025-01-09 16:46:14,393 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 429 flow [2025-01-09 16:46:14,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-01-09 16:46:14,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:14,394 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:14,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:46:14,394 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:46:14,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:14,395 INFO L85 PathProgramCache]: Analyzing trace with hash 633647024, now seen corresponding path program 6 times [2025-01-09 16:46:14,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:14,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616111084] [2025-01-09 16:46:14,395 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:46:14,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:14,404 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-01-09 16:46:14,420 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-01-09 16:46:14,423 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:46:14,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:14,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:14,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616111084] [2025-01-09 16:46:14,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616111084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:14,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:14,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:46:14,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219901958] [2025-01-09 16:46:14,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:14,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:46:14,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:14,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:46:14,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:46:14,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:46:14,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 429 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-01-09 16:46:14,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:14,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:46:14,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:15,056 INFO L124 PetriNetUnfolderBase]: 218/449 cut-off events. [2025-01-09 16:46:15,057 INFO L125 PetriNetUnfolderBase]: For 1430/1430 co-relation queries the response was YES. [2025-01-09 16:46:15,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1748 conditions, 449 events. 218/449 cut-off events. For 1430/1430 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1995 event pairs, 22 based on Foata normal form. 1/450 useless extension candidates. Maximal degree in co-relation 1726. Up to 287 conditions per place. [2025-01-09 16:46:15,061 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 55 selfloop transitions, 23 changer transitions 5/86 dead transitions. [2025-01-09 16:46:15,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 86 transitions, 734 flow [2025-01-09 16:46:15,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:46:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:46:15,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2025-01-09 16:46:15,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2025-01-09 16:46:15,066 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 429 flow. Second operand 10 states and 114 transitions. [2025-01-09 16:46:15,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 86 transitions, 734 flow [2025-01-09 16:46:15,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 86 transitions, 656 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-01-09 16:46:15,074 INFO L231 Difference]: Finished difference. Result has 76 places, 59 transitions, 452 flow [2025-01-09 16:46:15,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=452, PETRI_PLACES=76, PETRI_TRANSITIONS=59} [2025-01-09 16:46:15,076 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 48 predicate places. [2025-01-09 16:46:15,077 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 59 transitions, 452 flow [2025-01-09 16:46:15,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-01-09 16:46:15,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:15,078 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:15,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:46:15,078 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:46:15,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:15,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1602749428, now seen corresponding path program 7 times [2025-01-09 16:46:15,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:15,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303806777] [2025-01-09 16:46:15,079 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:46:15,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:15,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:46:15,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:46:15,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:15,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:15,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:15,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303806777] [2025-01-09 16:46:15,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303806777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:15,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:15,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:46:15,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510003794] [2025-01-09 16:46:15,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:15,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:46:15,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:15,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:46:15,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:46:15,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:46:15,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 59 transitions, 452 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-01-09 16:46:15,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:15,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:46:15,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:15,684 INFO L124 PetriNetUnfolderBase]: 214/436 cut-off events. [2025-01-09 16:46:15,684 INFO L125 PetriNetUnfolderBase]: For 1521/1521 co-relation queries the response was YES. [2025-01-09 16:46:15,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1756 conditions, 436 events. 214/436 cut-off events. For 1521/1521 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1921 event pairs, 22 based on Foata normal form. 1/437 useless extension candidates. Maximal degree in co-relation 1732. Up to 291 conditions per place. [2025-01-09 16:46:15,688 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 49 selfloop transitions, 22 changer transitions 8/82 dead transitions. [2025-01-09 16:46:15,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 82 transitions, 713 flow [2025-01-09 16:46:15,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:46:15,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:46:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2025-01-09 16:46:15,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3892857142857143 [2025-01-09 16:46:15,690 INFO L175 Difference]: Start difference. First operand has 76 places, 59 transitions, 452 flow. Second operand 10 states and 109 transitions. [2025-01-09 16:46:15,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 82 transitions, 713 flow [2025-01-09 16:46:15,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 82 transitions, 656 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-01-09 16:46:15,701 INFO L231 Difference]: Finished difference. Result has 79 places, 59 transitions, 448 flow [2025-01-09 16:46:15,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=448, PETRI_PLACES=79, PETRI_TRANSITIONS=59} [2025-01-09 16:46:15,702 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 51 predicate places. [2025-01-09 16:46:15,702 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 59 transitions, 448 flow [2025-01-09 16:46:15,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-01-09 16:46:15,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:15,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:15,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:46:15,703 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:46:15,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:15,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1340920176, now seen corresponding path program 8 times [2025-01-09 16:46:15,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:15,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171305706] [2025-01-09 16:46:15,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:46:15,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:15,711 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-09 16:46:15,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-01-09 16:46:15,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:46:15,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:16,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:16,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171305706] [2025-01-09 16:46:16,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171305706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:16,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:16,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:46:16,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498838656] [2025-01-09 16:46:16,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:16,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:46:16,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:16,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:46:16,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:46:16,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:46:16,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 59 transitions, 448 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-01-09 16:46:16,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:16,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:46:16,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:16,311 INFO L124 PetriNetUnfolderBase]: 223/461 cut-off events. [2025-01-09 16:46:16,312 INFO L125 PetriNetUnfolderBase]: For 1704/1704 co-relation queries the response was YES. [2025-01-09 16:46:16,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 461 events. 223/461 cut-off events. For 1704/1704 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2077 event pairs, 34 based on Foata normal form. 1/462 useless extension candidates. Maximal degree in co-relation 1827. Up to 297 conditions per place. [2025-01-09 16:46:16,315 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 58 selfloop transitions, 23 changer transitions 5/89 dead transitions. [2025-01-09 16:46:16,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 89 transitions, 788 flow [2025-01-09 16:46:16,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:46:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:46:16,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2025-01-09 16:46:16,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2025-01-09 16:46:16,317 INFO L175 Difference]: Start difference. First operand has 79 places, 59 transitions, 448 flow. Second operand 10 states and 116 transitions. [2025-01-09 16:46:16,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 89 transitions, 788 flow [2025-01-09 16:46:16,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 89 transitions, 734 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-01-09 16:46:16,326 INFO L231 Difference]: Finished difference. Result has 81 places, 62 transitions, 491 flow [2025-01-09 16:46:16,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=491, PETRI_PLACES=81, PETRI_TRANSITIONS=62} [2025-01-09 16:46:16,328 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 53 predicate places. [2025-01-09 16:46:16,329 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 62 transitions, 491 flow [2025-01-09 16:46:16,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-01-09 16:46:16,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:16,329 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:16,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:46:16,330 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:46:16,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:16,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2136638960, now seen corresponding path program 9 times [2025-01-09 16:46:16,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:16,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728640574] [2025-01-09 16:46:16,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:46:16,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:16,337 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-01-09 16:46:16,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-01-09 16:46:16,344 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:46:16,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:16,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:16,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:16,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728640574] [2025-01-09 16:46:16,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728640574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:16,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:16,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:46:16,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361650562] [2025-01-09 16:46:16,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:16,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:46:16,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:16,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:46:16,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:46:16,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:46:16,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 62 transitions, 491 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-01-09 16:46:16,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:16,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:46:16,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:16,843 INFO L124 PetriNetUnfolderBase]: 219/448 cut-off events. [2025-01-09 16:46:16,843 INFO L125 PetriNetUnfolderBase]: For 2196/2196 co-relation queries the response was YES. [2025-01-09 16:46:16,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1918 conditions, 448 events. 219/448 cut-off events. For 2196/2196 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2012 event pairs, 35 based on Foata normal form. 1/449 useless extension candidates. Maximal degree in co-relation 1891. Up to 301 conditions per place. [2025-01-09 16:46:16,847 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 52 selfloop transitions, 22 changer transitions 8/85 dead transitions. [2025-01-09 16:46:16,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 85 transitions, 793 flow [2025-01-09 16:46:16,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:46:16,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:46:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2025-01-09 16:46:16,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3964285714285714 [2025-01-09 16:46:16,849 INFO L175 Difference]: Start difference. First operand has 81 places, 62 transitions, 491 flow. Second operand 10 states and 111 transitions. [2025-01-09 16:46:16,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 85 transitions, 793 flow [2025-01-09 16:46:16,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 85 transitions, 726 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-01-09 16:46:16,856 INFO L231 Difference]: Finished difference. Result has 84 places, 62 transitions, 479 flow [2025-01-09 16:46:16,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=479, PETRI_PLACES=84, PETRI_TRANSITIONS=62} [2025-01-09 16:46:16,857 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 56 predicate places. [2025-01-09 16:46:16,858 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 62 transitions, 479 flow [2025-01-09 16:46:16,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-01-09 16:46:16,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:16,858 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:16,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:46:16,858 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:46:16,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:16,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1616479906, now seen corresponding path program 10 times [2025-01-09 16:46:16,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:16,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34272281] [2025-01-09 16:46:16,859 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:46:16,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:16,868 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-01-09 16:46:16,877 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:46:16,877 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:46:16,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:17,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:17,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:17,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34272281] [2025-01-09 16:46:17,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34272281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:17,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:17,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:46:17,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644552550] [2025-01-09 16:46:17,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:17,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:46:17,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:17,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:46:17,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:46:17,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-01-09 16:46:17,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 62 transitions, 479 flow. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:17,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:17,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-01-09 16:46:17,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:17,471 INFO L124 PetriNetUnfolderBase]: 260/516 cut-off events. [2025-01-09 16:46:17,471 INFO L125 PetriNetUnfolderBase]: For 2660/2660 co-relation queries the response was YES. [2025-01-09 16:46:17,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2187 conditions, 516 events. 260/516 cut-off events. For 2660/2660 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2260 event pairs, 49 based on Foata normal form. 1/517 useless extension candidates. Maximal degree in co-relation 2159. Up to 339 conditions per place. [2025-01-09 16:46:17,475 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 67 selfloop transitions, 23 changer transitions 5/97 dead transitions. [2025-01-09 16:46:17,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 97 transitions, 877 flow [2025-01-09 16:46:17,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:46:17,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:46:17,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2025-01-09 16:46:17,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2025-01-09 16:46:17,477 INFO L175 Difference]: Start difference. First operand has 84 places, 62 transitions, 479 flow. Second operand 10 states and 114 transitions. [2025-01-09 16:46:17,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 97 transitions, 877 flow [2025-01-09 16:46:17,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 97 transitions, 821 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-01-09 16:46:17,484 INFO L231 Difference]: Finished difference. Result has 87 places, 66 transitions, 546 flow [2025-01-09 16:46:17,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=546, PETRI_PLACES=87, PETRI_TRANSITIONS=66} [2025-01-09 16:46:17,485 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 59 predicate places. [2025-01-09 16:46:17,485 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 66 transitions, 546 flow [2025-01-09 16:46:17,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:17,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:17,485 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:17,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:46:17,486 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:46:17,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:17,486 INFO L85 PathProgramCache]: Analyzing trace with hash -820761122, now seen corresponding path program 11 times [2025-01-09 16:46:17,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:17,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790394789] [2025-01-09 16:46:17,487 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:46:17,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:17,492 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-09 16:46:17,502 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:46:17,502 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:17,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:17,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:17,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:17,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790394789] [2025-01-09 16:46:17,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790394789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:17,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:17,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:46:17,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159718276] [2025-01-09 16:46:17,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:17,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:46:17,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:17,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:46:17,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:46:17,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 28 [2025-01-09 16:46:17,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 66 transitions, 546 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-01-09 16:46:17,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:17,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 28 [2025-01-09 16:46:17,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:18,032 INFO L124 PetriNetUnfolderBase]: 229/465 cut-off events. [2025-01-09 16:46:18,033 INFO L125 PetriNetUnfolderBase]: For 3178/3178 co-relation queries the response was YES. [2025-01-09 16:46:18,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2117 conditions, 465 events. 229/465 cut-off events. For 3178/3178 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2044 event pairs, 30 based on Foata normal form. 1/465 useless extension candidates. Maximal degree in co-relation 2086. Up to 316 conditions per place. [2025-01-09 16:46:18,036 INFO L140 encePairwiseOnDemand]: 17/28 looper letters, 56 selfloop transitions, 21 changer transitions 8/88 dead transitions. [2025-01-09 16:46:18,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 88 transitions, 857 flow [2025-01-09 16:46:18,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:46:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:46:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2025-01-09 16:46:18,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-01-09 16:46:18,038 INFO L175 Difference]: Start difference. First operand has 87 places, 66 transitions, 546 flow. Second operand 10 states and 112 transitions. [2025-01-09 16:46:18,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 88 transitions, 857 flow [2025-01-09 16:46:18,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 88 transitions, 780 flow, removed 20 selfloop flow, removed 6 redundant places. [2025-01-09 16:46:18,046 INFO L231 Difference]: Finished difference. Result has 91 places, 66 transitions, 524 flow [2025-01-09 16:46:18,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=524, PETRI_PLACES=91, PETRI_TRANSITIONS=66} [2025-01-09 16:46:18,047 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 63 predicate places. [2025-01-09 16:46:18,047 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 66 transitions, 524 flow [2025-01-09 16:46:18,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-01-09 16:46:18,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:18,048 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:18,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:46:18,048 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:46:18,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:18,048 INFO L85 PathProgramCache]: Analyzing trace with hash 433837534, now seen corresponding path program 1 times [2025-01-09 16:46:18,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:18,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650615997] [2025-01-09 16:46:18,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:46:18,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:18,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:46:18,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:46:18,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:18,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:18,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:18,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:18,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650615997] [2025-01-09 16:46:18,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650615997] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:18,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295847133] [2025-01-09 16:46:18,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:46:18,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:18,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:18,130 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:46:18,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:46:18,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:46:18,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:46:18,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:18,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:18,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:46:18,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:18,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:18,280 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:46:18,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295847133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:18,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:46:18,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-09 16:46:18,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185021252] [2025-01-09 16:46:18,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:18,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:46:18,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:18,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:46:18,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:46:18,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2025-01-09 16:46:18,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 66 transitions, 524 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:18,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:18,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2025-01-09 16:46:18,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:18,434 INFO L124 PetriNetUnfolderBase]: 281/615 cut-off events. [2025-01-09 16:46:18,434 INFO L125 PetriNetUnfolderBase]: For 5574/5695 co-relation queries the response was YES. [2025-01-09 16:46:18,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2707 conditions, 615 events. 281/615 cut-off events. For 5574/5695 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3058 event pairs, 68 based on Foata normal form. 38/652 useless extension candidates. Maximal degree in co-relation 2675. Up to 205 conditions per place. [2025-01-09 16:46:18,438 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 54 selfloop transitions, 7 changer transitions 24/89 dead transitions. [2025-01-09 16:46:18,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 89 transitions, 845 flow [2025-01-09 16:46:18,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:46:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:46:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2025-01-09 16:46:18,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2025-01-09 16:46:18,440 INFO L175 Difference]: Start difference. First operand has 91 places, 66 transitions, 524 flow. Second operand 4 states and 74 transitions. [2025-01-09 16:46:18,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 89 transitions, 845 flow [2025-01-09 16:46:18,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 89 transitions, 772 flow, removed 6 selfloop flow, removed 12 redundant places. [2025-01-09 16:46:18,450 INFO L231 Difference]: Finished difference. Result has 82 places, 39 transitions, 290 flow [2025-01-09 16:46:18,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=290, PETRI_PLACES=82, PETRI_TRANSITIONS=39} [2025-01-09 16:46:18,451 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 54 predicate places. [2025-01-09 16:46:18,451 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 39 transitions, 290 flow [2025-01-09 16:46:18,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:18,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:18,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:18,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:46:18,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 16:46:18,655 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:46:18,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:18,656 INFO L85 PathProgramCache]: Analyzing trace with hash -145247330, now seen corresponding path program 1 times [2025-01-09 16:46:18,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:18,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168383160] [2025-01-09 16:46:18,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:46:18,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:18,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:46:18,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:46:18,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:18,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:18,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:18,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168383160] [2025-01-09 16:46:18,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168383160] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:18,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402270555] [2025-01-09 16:46:18,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:46:18,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:18,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:18,743 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:46:18,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:46:18,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:46:18,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:46:18,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:18,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:18,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:46:18,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:18,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:18,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402270555] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:46:18,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:46:18,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-09 16:46:18,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655352061] [2025-01-09 16:46:18,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:46:18,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:46:18,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:18,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:46:18,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:46:18,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2025-01-09 16:46:18,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 39 transitions, 290 flow. Second operand has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 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-01-09 16:46:18,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:18,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2025-01-09 16:46:18,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:19,131 INFO L124 PetriNetUnfolderBase]: 281/592 cut-off events. [2025-01-09 16:46:19,131 INFO L125 PetriNetUnfolderBase]: For 4619/4664 co-relation queries the response was YES. [2025-01-09 16:46:19,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2666 conditions, 592 events. 281/592 cut-off events. For 4619/4664 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2635 event pairs, 173 based on Foata normal form. 24/615 useless extension candidates. Maximal degree in co-relation 2635. Up to 392 conditions per place. [2025-01-09 16:46:19,135 INFO L140 encePairwiseOnDemand]: 23/28 looper letters, 33 selfloop transitions, 3 changer transitions 25/65 dead transitions. [2025-01-09 16:46:19,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 65 transitions, 593 flow [2025-01-09 16:46:19,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:46:19,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:46:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2025-01-09 16:46:19,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-01-09 16:46:19,138 INFO L175 Difference]: Start difference. First operand has 82 places, 39 transitions, 290 flow. Second operand 6 states and 77 transitions. [2025-01-09 16:46:19,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 65 transitions, 593 flow [2025-01-09 16:46:19,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 468 flow, removed 51 selfloop flow, removed 18 redundant places. [2025-01-09 16:46:19,145 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 232 flow [2025-01-09 16:46:19,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2025-01-09 16:46:19,145 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 25 predicate places. [2025-01-09 16:46:19,145 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 232 flow [2025-01-09 16:46:19,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 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-01-09 16:46:19,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:19,145 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] [2025-01-09 16:46:19,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:46:19,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 16:46:19,346 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:46:19,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:19,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1941701126, now seen corresponding path program 2 times [2025-01-09 16:46:19,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:19,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767470614] [2025-01-09 16:46:19,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:46:19,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:19,356 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-09 16:46:19,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 24 statements. [2025-01-09 16:46:19,368 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:46:19,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:19,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:46:19,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:19,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767470614] [2025-01-09 16:46:19,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767470614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:19,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:46:19,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:46:19,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293671811] [2025-01-09 16:46:19,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:19,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:46:19,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:19,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:46:19,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:46:19,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2025-01-09 16:46:19,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:19,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:19,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2025-01-09 16:46:19,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:19,600 INFO L124 PetriNetUnfolderBase]: 408/737 cut-off events. [2025-01-09 16:46:19,600 INFO L125 PetriNetUnfolderBase]: For 976/976 co-relation queries the response was YES. [2025-01-09 16:46:19,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2340 conditions, 737 events. 408/737 cut-off events. For 976/976 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2865 event pairs, 64 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 2322. Up to 320 conditions per place. [2025-01-09 16:46:19,605 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 60 selfloop transitions, 8 changer transitions 0/70 dead transitions. [2025-01-09 16:46:19,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 532 flow [2025-01-09 16:46:19,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:46:19,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:46:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2025-01-09 16:46:19,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2025-01-09 16:46:19,607 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 232 flow. Second operand 6 states and 69 transitions. [2025-01-09 16:46:19,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 532 flow [2025-01-09 16:46:19,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 70 transitions, 502 flow, removed 13 selfloop flow, removed 4 redundant places. [2025-01-09 16:46:19,610 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 263 flow [2025-01-09 16:46:19,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=263, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2025-01-09 16:46:19,611 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 26 predicate places. [2025-01-09 16:46:19,611 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 263 flow [2025-01-09 16:46:19,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:46:19,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:19,612 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:19,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:46:19,612 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:46:19,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:19,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2127068898, now seen corresponding path program 1 times [2025-01-09 16:46:19,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:19,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812536156] [2025-01-09 16:46:19,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:46:19,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:19,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:46:19,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:46:19,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:19,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:20,724 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:20,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:20,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812536156] [2025-01-09 16:46:20,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812536156] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:20,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673969196] [2025-01-09 16:46:20,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:46:20,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:20,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:20,728 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:46:20,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:46:20,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:46:20,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:46:20,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:20,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:20,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-01-09 16:46:20,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:21,722 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:21,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:22,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:46:22,355 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 42 treesize of output 34 [2025-01-09 16:46:23,025 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:23,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673969196] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:46:23,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:46:23,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 49 [2025-01-09 16:46:23,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346227857] [2025-01-09 16:46:23,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:46:23,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-01-09 16:46:23,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:23,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-01-09 16:46:23,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=2171, Unknown=0, NotChecked=0, Total=2450 [2025-01-09 16:46:23,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-01-09 16:46:23,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 263 flow. Second operand has 50 states, 50 states have (on average 4.52) internal successors, (226), 50 states have internal predecessors, (226), 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-01-09 16:46:23,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:23,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-01-09 16:46:23,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:26,717 INFO L124 PetriNetUnfolderBase]: 850/1499 cut-off events. [2025-01-09 16:46:26,717 INFO L125 PetriNetUnfolderBase]: For 2964/2964 co-relation queries the response was YES. [2025-01-09 16:46:26,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5203 conditions, 1499 events. 850/1499 cut-off events. For 2964/2964 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7039 event pairs, 109 based on Foata normal form. 2/1501 useless extension candidates. Maximal degree in co-relation 5186. Up to 825 conditions per place. [2025-01-09 16:46:26,727 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 126 selfloop transitions, 120 changer transitions 10/257 dead transitions. [2025-01-09 16:46:26,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 257 transitions, 1911 flow [2025-01-09 16:46:26,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-09 16:46:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-01-09 16:46:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 363 transitions. [2025-01-09 16:46:26,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2700892857142857 [2025-01-09 16:46:26,731 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 263 flow. Second operand 48 states and 363 transitions. [2025-01-09 16:46:26,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 257 transitions, 1911 flow [2025-01-09 16:46:26,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 257 transitions, 1875 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-01-09 16:46:26,740 INFO L231 Difference]: Finished difference. Result has 114 places, 159 transitions, 1521 flow [2025-01-09 16:46:26,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=1521, PETRI_PLACES=114, PETRI_TRANSITIONS=159} [2025-01-09 16:46:26,742 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 86 predicate places. [2025-01-09 16:46:26,742 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 159 transitions, 1521 flow [2025-01-09 16:46:26,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.52) internal successors, (226), 50 states have internal predecessors, (226), 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-01-09 16:46:26,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:26,742 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] [2025-01-09 16:46:26,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:46:26,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:26,943 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:46:26,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:26,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2068232398, now seen corresponding path program 2 times [2025-01-09 16:46:26,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:26,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954987350] [2025-01-09 16:46:26,944 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:46:26,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:26,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:46:26,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:46:26,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:26,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:27,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:27,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954987350] [2025-01-09 16:46:27,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954987350] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:27,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657056837] [2025-01-09 16:46:27,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:46:27,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:27,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:27,932 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:46:27,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:46:27,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:46:28,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:46:28,012 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:28,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:28,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 16:46:28,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:28,619 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 16:46:28,619 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 23 treesize of output 10 [2025-01-09 16:46:28,810 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:28,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:29,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:46:29,375 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 40 treesize of output 32 [2025-01-09 16:46:29,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:29,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657056837] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:46:29,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:46:29,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 50 [2025-01-09 16:46:29,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774894554] [2025-01-09 16:46:29,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:46:29,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-01-09 16:46:29,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:29,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-01-09 16:46:29,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2348, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 16:46:29,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-01-09 16:46:29,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 159 transitions, 1521 flow. Second operand has 51 states, 51 states have (on average 4.529411764705882) internal successors, (231), 51 states have internal predecessors, (231), 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-01-09 16:46:29,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:29,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-01-09 16:46:29,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:38,504 INFO L124 PetriNetUnfolderBase]: 1331/2349 cut-off events. [2025-01-09 16:46:38,504 INFO L125 PetriNetUnfolderBase]: For 8251/8251 co-relation queries the response was YES. [2025-01-09 16:46:38,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10920 conditions, 2349 events. 1331/2349 cut-off events. For 8251/8251 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12598 event pairs, 57 based on Foata normal form. 2/2351 useless extension candidates. Maximal degree in co-relation 10888. Up to 908 conditions per place. [2025-01-09 16:46:38,518 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 207 selfloop transitions, 290 changer transitions 10/508 dead transitions. [2025-01-09 16:46:38,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 508 transitions, 4933 flow [2025-01-09 16:46:38,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-01-09 16:46:38,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2025-01-09 16:46:38,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 559 transitions. [2025-01-09 16:46:38,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28520408163265304 [2025-01-09 16:46:38,521 INFO L175 Difference]: Start difference. First operand has 114 places, 159 transitions, 1521 flow. Second operand 70 states and 559 transitions. [2025-01-09 16:46:38,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 508 transitions, 4933 flow [2025-01-09 16:46:38,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 508 transitions, 4553 flow, removed 188 selfloop flow, removed 5 redundant places. [2025-01-09 16:46:38,598 INFO L231 Difference]: Finished difference. Result has 197 places, 348 transitions, 3984 flow [2025-01-09 16:46:38,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1293, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=3984, PETRI_PLACES=197, PETRI_TRANSITIONS=348} [2025-01-09 16:46:38,600 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 169 predicate places. [2025-01-09 16:46:38,600 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 348 transitions, 3984 flow [2025-01-09 16:46:38,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 4.529411764705882) internal successors, (231), 51 states have internal predecessors, (231), 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-01-09 16:46:38,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:38,601 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] [2025-01-09 16:46:38,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 16:46:38,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 16:46:38,805 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:46:38,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:38,805 INFO L85 PathProgramCache]: Analyzing trace with hash 33554044, now seen corresponding path program 3 times [2025-01-09 16:46:38,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:38,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937534585] [2025-01-09 16:46:38,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:46:38,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:38,811 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:46:38,841 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:46:38,843 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:46:38,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:39,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:39,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937534585] [2025-01-09 16:46:39,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937534585] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:39,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340073294] [2025-01-09 16:46:39,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:46:39,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:39,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:39,752 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:46:39,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:46:39,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:46:39,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:46:39,836 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:46:39,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:39,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-09 16:46:39,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:40,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:41,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:46:41,046 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 40 treesize of output 32 [2025-01-09 16:46:41,523 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:41,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340073294] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:46:41,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:46:41,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 50 [2025-01-09 16:46:41,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838053488] [2025-01-09 16:46:41,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:46:41,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-01-09 16:46:41,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:41,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-01-09 16:46:41,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2339, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 16:46:41,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-01-09 16:46:41,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 348 transitions, 3984 flow. Second operand has 51 states, 51 states have (on average 4.529411764705882) internal successors, (231), 51 states have internal predecessors, (231), 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-01-09 16:46:41,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:41,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-01-09 16:46:41,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:00,469 INFO L124 PetriNetUnfolderBase]: 2157/3884 cut-off events. [2025-01-09 16:47:00,469 INFO L125 PetriNetUnfolderBase]: For 26777/26777 co-relation queries the response was YES. [2025-01-09 16:47:00,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22142 conditions, 3884 events. 2157/3884 cut-off events. For 26777/26777 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 23925 event pairs, 82 based on Foata normal form. 88/3972 useless extension candidates. Maximal degree in co-relation 22092. Up to 1332 conditions per place. [2025-01-09 16:47:00,496 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 344 selfloop transitions, 546 changer transitions 74/965 dead transitions. [2025-01-09 16:47:00,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 965 transitions, 11497 flow [2025-01-09 16:47:00,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2025-01-09 16:47:00,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2025-01-09 16:47:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 1027 transitions. [2025-01-09 16:47:00,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28433001107419714 [2025-01-09 16:47:00,502 INFO L175 Difference]: Start difference. First operand has 197 places, 348 transitions, 3984 flow. Second operand 129 states and 1027 transitions. [2025-01-09 16:47:00,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 965 transitions, 11497 flow [2025-01-09 16:47:00,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 965 transitions, 10754 flow, removed 365 selfloop flow, removed 7 redundant places. [2025-01-09 16:47:00,694 INFO L231 Difference]: Finished difference. Result has 360 places, 666 transitions, 9168 flow [2025-01-09 16:47:00,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=3487, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=267, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=129, PETRI_FLOW=9168, PETRI_PLACES=360, PETRI_TRANSITIONS=666} [2025-01-09 16:47:00,695 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 332 predicate places. [2025-01-09 16:47:00,695 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 666 transitions, 9168 flow [2025-01-09 16:47:00,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 4.529411764705882) internal successors, (231), 51 states have internal predecessors, (231), 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-01-09 16:47:00,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:00,695 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] [2025-01-09 16:47:00,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 16:47:00,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:00,896 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:47:00,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:00,897 INFO L85 PathProgramCache]: Analyzing trace with hash -383110954, now seen corresponding path program 4 times [2025-01-09 16:47:00,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:00,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102522035] [2025-01-09 16:47:00,897 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:47:00,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:00,902 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:47:00,914 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:47:00,914 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:47:00,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:01,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:01,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102522035] [2025-01-09 16:47:01,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102522035] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:01,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560796782] [2025-01-09 16:47:01,724 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:47:01,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:01,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:01,726 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:47:01,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 16:47:01,777 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:47:01,806 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:47:01,806 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:47:01,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:01,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-09 16:47:01,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:02,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:47:03,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:47:03,108 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 51 treesize of output 35 [2025-01-09 16:47:03,575 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:03,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560796782] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:47:03,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:47:03,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 53 [2025-01-09 16:47:03,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918262187] [2025-01-09 16:47:03,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:47:03,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-01-09 16:47:03,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:03,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-01-09 16:47:03,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=2617, Unknown=0, NotChecked=0, Total=2862 [2025-01-09 16:47:03,594 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-01-09 16:47:03,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 666 transitions, 9168 flow. Second operand has 54 states, 54 states have (on average 4.444444444444445) internal successors, (240), 54 states have internal predecessors, (240), 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-01-09 16:47:03,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:03,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-01-09 16:47:03,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:10,147 INFO L124 PetriNetUnfolderBase]: 2223/4047 cut-off events. [2025-01-09 16:47:10,147 INFO L125 PetriNetUnfolderBase]: For 34456/34456 co-relation queries the response was YES. [2025-01-09 16:47:10,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25859 conditions, 4047 events. 2223/4047 cut-off events. For 34456/34456 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 25705 event pairs, 35 based on Foata normal form. 2/4049 useless extension candidates. Maximal degree in co-relation 25767. Up to 1423 conditions per place. [2025-01-09 16:47:10,181 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 397 selfloop transitions, 553 changer transitions 10/961 dead transitions. [2025-01-09 16:47:10,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 961 transitions, 13718 flow [2025-01-09 16:47:10,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-01-09 16:47:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2025-01-09 16:47:10,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 586 transitions. [2025-01-09 16:47:10,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28669275929549903 [2025-01-09 16:47:10,190 INFO L175 Difference]: Start difference. First operand has 360 places, 666 transitions, 9168 flow. Second operand 73 states and 586 transitions. [2025-01-09 16:47:10,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 961 transitions, 13718 flow [2025-01-09 16:47:10,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 961 transitions, 12036 flow, removed 794 selfloop flow, removed 22 redundant places. [2025-01-09 16:47:10,696 INFO L231 Difference]: Finished difference. Result has 406 places, 766 transitions, 11015 flow [2025-01-09 16:47:10,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=7830, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=461, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=73, PETRI_FLOW=11015, PETRI_PLACES=406, PETRI_TRANSITIONS=766} [2025-01-09 16:47:10,697 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 378 predicate places. [2025-01-09 16:47:10,697 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 766 transitions, 11015 flow [2025-01-09 16:47:10,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 4.444444444444445) internal successors, (240), 54 states have internal predecessors, (240), 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-01-09 16:47:10,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:10,697 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] [2025-01-09 16:47:10,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 16:47:10,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:10,898 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:47:10,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:10,898 INFO L85 PathProgramCache]: Analyzing trace with hash -155854638, now seen corresponding path program 5 times [2025-01-09 16:47:10,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:10,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316295519] [2025-01-09 16:47:10,898 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:47:10,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:10,904 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:47:10,928 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:47:10,928 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:47:10,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:11,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:11,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:11,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316295519] [2025-01-09 16:47:11,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316295519] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:11,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31170516] [2025-01-09 16:47:11,958 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:47:11,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:11,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:11,960 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:47:11,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 16:47:12,010 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:47:12,034 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:47:12,034 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:47:12,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:12,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-09 16:47:12,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:12,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:12,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:47:13,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:47:13,172 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 51 treesize of output 35 [2025-01-09 16:47:13,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:13,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31170516] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:47:13,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:47:13,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 53 [2025-01-09 16:47:13,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011956330] [2025-01-09 16:47:13,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:47:13,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-01-09 16:47:13,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:13,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-01-09 16:47:13,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=2601, Unknown=0, NotChecked=0, Total=2862 [2025-01-09 16:47:13,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-01-09 16:47:13,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 766 transitions, 11015 flow. Second operand has 54 states, 54 states have (on average 4.444444444444445) internal successors, (240), 54 states have internal predecessors, (240), 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-01-09 16:47:13,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:13,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-01-09 16:47:13,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:23,140 INFO L124 PetriNetUnfolderBase]: 2510/4642 cut-off events. [2025-01-09 16:47:23,140 INFO L125 PetriNetUnfolderBase]: For 34311/34311 co-relation queries the response was YES. [2025-01-09 16:47:23,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29803 conditions, 4642 events. 2510/4642 cut-off events. For 34311/34311 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 31045 event pairs, 59 based on Foata normal form. 5/4647 useless extension candidates. Maximal degree in co-relation 29707. Up to 1484 conditions per place. [2025-01-09 16:47:23,181 INFO L140 encePairwiseOnDemand]: 12/28 looper letters, 408 selfloop transitions, 711 changer transitions 29/1149 dead transitions. [2025-01-09 16:47:23,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 502 places, 1149 transitions, 16519 flow [2025-01-09 16:47:23,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-01-09 16:47:23,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2025-01-09 16:47:23,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 778 transitions. [2025-01-09 16:47:23,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28066378066378067 [2025-01-09 16:47:23,184 INFO L175 Difference]: Start difference. First operand has 406 places, 766 transitions, 11015 flow. Second operand 99 states and 778 transitions. [2025-01-09 16:47:23,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 502 places, 1149 transitions, 16519 flow [2025-01-09 16:47:23,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 1149 transitions, 16167 flow, removed 98 selfloop flow, removed 25 redundant places. [2025-01-09 16:47:23,787 INFO L231 Difference]: Finished difference. Result has 494 places, 895 transitions, 14909 flow [2025-01-09 16:47:23,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=10681, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=766, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=595, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=99, PETRI_FLOW=14909, PETRI_PLACES=494, PETRI_TRANSITIONS=895} [2025-01-09 16:47:23,788 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 466 predicate places. [2025-01-09 16:47:23,788 INFO L471 AbstractCegarLoop]: Abstraction has has 494 places, 895 transitions, 14909 flow [2025-01-09 16:47:23,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 4.444444444444445) internal successors, (240), 54 states have internal predecessors, (240), 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-01-09 16:47:23,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:23,788 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] [2025-01-09 16:47:23,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 16:47:23,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:23,989 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:47:23,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:23,989 INFO L85 PathProgramCache]: Analyzing trace with hash 451503648, now seen corresponding path program 6 times [2025-01-09 16:47:23,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:23,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138729195] [2025-01-09 16:47:23,989 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:47:23,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:23,994 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:47:24,007 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:47:24,007 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-01-09 16:47:24,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:25,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:25,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138729195] [2025-01-09 16:47:25,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138729195] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:25,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077858440] [2025-01-09 16:47:25,016 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:47:25,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:25,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:25,018 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:47:25,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 16:47:25,069 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:47:25,111 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:47:25,111 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-01-09 16:47:25,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:25,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 16:47:25,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:25,589 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 16:47:25,589 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 23 treesize of output 10 [2025-01-09 16:47:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:25,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:47:26,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:47:26,590 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 32 treesize of output 24 [2025-01-09 16:47:27,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:47:27,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077858440] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:47:27,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:47:27,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 50 [2025-01-09 16:47:27,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494430010] [2025-01-09 16:47:27,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:47:27,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-01-09 16:47:27,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:27,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-01-09 16:47:27,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=2312, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 16:47:27,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2025-01-09 16:47:27,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 895 transitions, 14909 flow. Second operand has 51 states, 51 states have (on average 4.529411764705882) internal successors, (231), 51 states have internal predecessors, (231), 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-01-09 16:47:27,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:27,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2025-01-09 16:47:27,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand