./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-vector-add.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-vector-add.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 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:47:04,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:47:04,667 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:47:04,672 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:47:04,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:47:04,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:47:04,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:47:04,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:47:04,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:47:04,699 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:47:04,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:47:04,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:47:04,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:47:04,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:47:04,700 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:47:04,700 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:47:04,700 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:47:04,700 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:47:04,700 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:47:04,701 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:47:04,701 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:47:04,701 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:47:04,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:47:04,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:47:04,701 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:47:04,701 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:47:04,701 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:47:04,701 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:47:04,701 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:47:04,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:47:04,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:47:04,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:47:04,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:47:04,702 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:47:04,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:47:04,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:47:04,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:47:04,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:47:04,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:47:04,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:47:04,703 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:47:04,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:47:04,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:47:04,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:47:04,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:47:04,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:47:04,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:47:04,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:47:04,703 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 -> 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 [2025-01-09 16:47:04,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:47:04,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:47:04,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:47:04,906 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:47:04,907 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:47:04,907 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2025-01-09 16:47:06,047 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/726f18025/cf0af1bbee2a4365bbfb9e5328c10c41/FLAG102d4e964 [2025-01-09 16:47:06,314 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:47:06,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2025-01-09 16:47:06,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/726f18025/cf0af1bbee2a4365bbfb9e5328c10c41/FLAG102d4e964 [2025-01-09 16:47:06,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/726f18025/cf0af1bbee2a4365bbfb9e5328c10c41 [2025-01-09 16:47:06,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:47:06,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:47:06,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:47:06,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:47:06,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:47:06,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:47:06" (1/1) ... [2025-01-09 16:47:06,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ba6db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:06, skipping insertion in model container [2025-01-09 16:47:06,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:47:06" (1/1) ... [2025-01-09 16:47:06,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:47:06,508 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-vector-add.wvr.c[2637,2650] [2025-01-09 16:47:06,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:47:06,527 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:47:06,543 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-vector-add.wvr.c[2637,2650] [2025-01-09 16:47:06,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:47:06,556 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:47:06,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:06 WrapperNode [2025-01-09 16:47:06,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:47:06,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:47:06,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:47:06,559 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:47:06,564 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:47:06" (1/1) ... [2025-01-09 16:47:06,570 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:47:06" (1/1) ... [2025-01-09 16:47:06,590 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 11, calls inlined = 17, statements flattened = 173 [2025-01-09 16:47:06,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:47:06,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:47:06,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:47:06,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:47:06,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:06" (1/1) ... [2025-01-09 16:47:06,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:06" (1/1) ... [2025-01-09 16:47:06,602 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:06" (1/1) ... [2025-01-09 16:47:06,622 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2025-01-09 16:47:06,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:06" (1/1) ... [2025-01-09 16:47:06,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:06" (1/1) ... [2025-01-09 16:47:06,637 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:06" (1/1) ... [2025-01-09 16:47:06,641 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:06" (1/1) ... [2025-01-09 16:47:06,643 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:06" (1/1) ... [2025-01-09 16:47:06,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:06" (1/1) ... [2025-01-09 16:47:06,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:06" (1/1) ... [2025-01-09 16:47:06,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:47:06,649 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:47:06,649 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:47:06,649 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:47:06,652 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:06" (1/1) ... [2025-01-09 16:47:06,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:47:06,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:06,680 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:47:06,685 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:47:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:47:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:47:06,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:47:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:47:06,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:47:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:47:06,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:47:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:47:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:47:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:47:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:47:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:47:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:47:06,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:47:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:47:06,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:47:06,702 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:47:06,784 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:47:06,785 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:47:07,093 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:47:07,095 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:47:07,325 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:47:07,325 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:47:07,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:47:07 BoogieIcfgContainer [2025-01-09 16:47:07,326 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:47:07,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:47:07,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:47:07,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:47:07,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:47:06" (1/3) ... [2025-01-09 16:47:07,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f16c9cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:47:07, skipping insertion in model container [2025-01-09 16:47:07,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:47:06" (2/3) ... [2025-01-09 16:47:07,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f16c9cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:47:07, skipping insertion in model container [2025-01-09 16:47:07,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:47:07" (3/3) ... [2025-01-09 16:47:07,332 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2025-01-09 16:47:07,342 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:47:07,343 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-vector-add.wvr.c that has 4 procedures, 27 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-01-09 16:47:07,343 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:47:07,390 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:47:07,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 33 transitions, 87 flow [2025-01-09 16:47:07,470 INFO L124 PetriNetUnfolderBase]: 7/30 cut-off events. [2025-01-09 16:47:07,474 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:47:07,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 7/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-01-09 16:47:07,479 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 33 transitions, 87 flow [2025-01-09 16:47:07,482 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 29 transitions, 76 flow [2025-01-09 16:47:07,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:47:07,505 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;@7df9be73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:47:07,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:47:07,525 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:47:07,525 INFO L124 PetriNetUnfolderBase]: 7/28 cut-off events. [2025-01-09 16:47:07,525 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:47:07,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:07,526 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] [2025-01-09 16:47:07,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:47:07,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:07,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1042301347, now seen corresponding path program 1 times [2025-01-09 16:47:07,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:07,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805693925] [2025-01-09 16:47:07,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:07,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:07,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:47:07,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:47:07,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:07,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:08,009 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:47:08,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:08,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805693925] [2025-01-09 16:47:08,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805693925] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:08,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:08,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:47:08,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85799355] [2025-01-09 16:47:08,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:08,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:47:08,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:08,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:47:08,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:47:08,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-01-09 16:47:08,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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:08,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:08,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-01-09 16:47:08,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:08,306 INFO L124 PetriNetUnfolderBase]: 405/602 cut-off events. [2025-01-09 16:47:08,306 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 16:47:08,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1286 conditions, 602 events. 405/602 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1666 event pairs, 248 based on Foata normal form. 1/445 useless extension candidates. Maximal degree in co-relation 534. Up to 301 conditions per place. [2025-01-09 16:47:08,314 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 24 selfloop transitions, 8 changer transitions 25/58 dead transitions. [2025-01-09 16:47:08,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 58 transitions, 266 flow [2025-01-09 16:47:08,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:47:08,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:47:08,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2025-01-09 16:47:08,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-01-09 16:47:08,329 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 76 flow. Second operand 5 states and 81 transitions. [2025-01-09 16:47:08,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 58 transitions, 266 flow [2025-01-09 16:47:08,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 58 transitions, 242 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:47:08,338 INFO L231 Difference]: Finished difference. Result has 33 places, 33 transitions, 116 flow [2025-01-09 16:47:08,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=33, PETRI_TRANSITIONS=33} [2025-01-09 16:47:08,345 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2025-01-09 16:47:08,347 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 116 flow [2025-01-09 16:47:08,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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:08,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:08,348 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:08,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:47:08,348 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:47:08,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:08,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1132435120, now seen corresponding path program 1 times [2025-01-09 16:47:08,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:08,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938060589] [2025-01-09 16:47:08,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:08,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:08,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:47:08,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:47:08,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:08,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:08,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:47:08,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:08,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938060589] [2025-01-09 16:47:08,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938060589] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:08,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525890632] [2025-01-09 16:47:08,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:08,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:08,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:08,630 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:47:08,632 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:47:08,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:47:08,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:47:08,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:08,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:08,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:47:08,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:47:08,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:47:08,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:47:08,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525890632] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:08,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:47:08,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-01-09 16:47:08,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687866050] [2025-01-09 16:47:08,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:08,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:47:08,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:08,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:47:08,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:47:08,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-01-09 16:47:08,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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:47:08,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:08,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-01-09 16:47:08,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:08,946 INFO L124 PetriNetUnfolderBase]: 262/390 cut-off events. [2025-01-09 16:47:08,946 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:47:08,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 390 events. 262/390 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1023 event pairs, 124 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 814. Up to 303 conditions per place. [2025-01-09 16:47:08,948 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 40 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2025-01-09 16:47:08,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 45 transitions, 230 flow [2025-01-09 16:47:08,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:47:08,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:47:08,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2025-01-09 16:47:08,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2025-01-09 16:47:08,950 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 116 flow. Second operand 5 states and 62 transitions. [2025-01-09 16:47:08,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 45 transitions, 230 flow [2025-01-09 16:47:08,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 45 transitions, 212 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-01-09 16:47:08,951 INFO L231 Difference]: Finished difference. Result has 33 places, 34 transitions, 114 flow [2025-01-09 16:47:08,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=33, PETRI_TRANSITIONS=34} [2025-01-09 16:47:08,951 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2025-01-09 16:47:08,952 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 34 transitions, 114 flow [2025-01-09 16:47:08,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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:47:08,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:08,952 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:08,958 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:47:09,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:09,153 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:47:09,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:09,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1066963287, now seen corresponding path program 1 times [2025-01-09 16:47:09,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:09,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913017112] [2025-01-09 16:47:09,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:09,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:09,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:47:09,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:47:09,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:09,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:09,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:47:09,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:09,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913017112] [2025-01-09 16:47:09,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913017112] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:09,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041702679] [2025-01-09 16:47:09,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:09,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:09,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:09,375 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:47:09,377 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:47:09,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:47:09,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:47:09,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:09,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:09,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:47:09,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:09,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:47:09,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:47:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:47:09,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041702679] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:09,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:47:09,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2025-01-09 16:47:09,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632990203] [2025-01-09 16:47:09,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:09,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:47:09,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:09,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:47:09,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:47:09,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-01-09 16:47:09,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 34 transitions, 114 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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:09,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:09,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-01-09 16:47:09,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:09,852 INFO L124 PetriNetUnfolderBase]: 443/657 cut-off events. [2025-01-09 16:47:09,853 INFO L125 PetriNetUnfolderBase]: For 224/224 co-relation queries the response was YES. [2025-01-09 16:47:09,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1577 conditions, 657 events. 443/657 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2090 event pairs, 169 based on Foata normal form. 0/492 useless extension candidates. Maximal degree in co-relation 1531. Up to 388 conditions per place. [2025-01-09 16:47:09,858 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 61 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2025-01-09 16:47:09,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 69 transitions, 358 flow [2025-01-09 16:47:09,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:47:09,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:47:09,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2025-01-09 16:47:09,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38961038961038963 [2025-01-09 16:47:09,863 INFO L175 Difference]: Start difference. First operand has 33 places, 34 transitions, 114 flow. Second operand 7 states and 90 transitions. [2025-01-09 16:47:09,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 69 transitions, 358 flow [2025-01-09 16:47:09,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 69 transitions, 338 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-01-09 16:47:09,866 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 146 flow [2025-01-09 16:47:09,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=146, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2025-01-09 16:47:09,867 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2025-01-09 16:47:09,867 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 146 flow [2025-01-09 16:47:09,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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:09,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:09,867 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:09,880 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:47:10,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:10,068 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:47:10,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:10,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1618989437, now seen corresponding path program 2 times [2025-01-09 16:47:10,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:10,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926142726] [2025-01-09 16:47:10,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:47:10,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:10,091 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:47:10,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 27 statements. [2025-01-09 16:47:10,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:47:10,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:10,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 16:47:10,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:10,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926142726] [2025-01-09 16:47:10,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926142726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:10,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:10,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:47:10,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501404175] [2025-01-09 16:47:10,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:10,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:47:10,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:10,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:47:10,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:47:10,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-01-09 16:47:10,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:10,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:10,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-01-09 16:47:10,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:10,461 INFO L124 PetriNetUnfolderBase]: 693/1027 cut-off events. [2025-01-09 16:47:10,461 INFO L125 PetriNetUnfolderBase]: For 613/613 co-relation queries the response was YES. [2025-01-09 16:47:10,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2974 conditions, 1027 events. 693/1027 cut-off events. For 613/613 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3574 event pairs, 291 based on Foata normal form. 1/809 useless extension candidates. Maximal degree in co-relation 2925. Up to 642 conditions per place. [2025-01-09 16:47:10,466 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 65 selfloop transitions, 7 changer transitions 9/82 dead transitions. [2025-01-09 16:47:10,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 82 transitions, 468 flow [2025-01-09 16:47:10,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:47:10,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:47:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2025-01-09 16:47:10,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4494949494949495 [2025-01-09 16:47:10,468 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 146 flow. Second operand 6 states and 89 transitions. [2025-01-09 16:47:10,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 82 transitions, 468 flow [2025-01-09 16:47:10,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 82 transitions, 447 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-01-09 16:47:10,473 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 186 flow [2025-01-09 16:47:10,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2025-01-09 16:47:10,473 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2025-01-09 16:47:10,473 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 186 flow [2025-01-09 16:47:10,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:10,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:10,473 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:10,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:47:10,474 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:47:10,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:10,474 INFO L85 PathProgramCache]: Analyzing trace with hash 301732209, now seen corresponding path program 3 times [2025-01-09 16:47:10,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:10,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146576292] [2025-01-09 16:47:10,474 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:47:10,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:10,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:47:10,493 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 27 statements. [2025-01-09 16:47:10,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:47:10,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:10,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 16:47:10,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:10,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146576292] [2025-01-09 16:47:10,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146576292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:10,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:10,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:47:10,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434538813] [2025-01-09 16:47:10,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:10,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:47:10,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:10,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:47:10,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:47:10,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-01-09 16:47:10,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:10,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:10,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-01-09 16:47:10,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:10,784 INFO L124 PetriNetUnfolderBase]: 748/1101 cut-off events. [2025-01-09 16:47:10,784 INFO L125 PetriNetUnfolderBase]: For 1246/1246 co-relation queries the response was YES. [2025-01-09 16:47:10,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3673 conditions, 1101 events. 748/1101 cut-off events. For 1246/1246 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3930 event pairs, 366 based on Foata normal form. 1/926 useless extension candidates. Maximal degree in co-relation 3645. Up to 827 conditions per place. [2025-01-09 16:47:10,792 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 61 selfloop transitions, 11 changer transitions 9/82 dead transitions. [2025-01-09 16:47:10,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 82 transitions, 514 flow [2025-01-09 16:47:10,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:47:10,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:47:10,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2025-01-09 16:47:10,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4494949494949495 [2025-01-09 16:47:10,793 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 186 flow. Second operand 6 states and 89 transitions. [2025-01-09 16:47:10,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 82 transitions, 514 flow [2025-01-09 16:47:10,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 82 transitions, 488 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-01-09 16:47:10,799 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 257 flow [2025-01-09 16:47:10,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=257, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2025-01-09 16:47:10,799 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2025-01-09 16:47:10,799 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 257 flow [2025-01-09 16:47:10,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:10,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:10,799 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:10,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:47:10,800 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:47:10,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:10,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1837501433, now seen corresponding path program 4 times [2025-01-09 16:47:10,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:10,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515450995] [2025-01-09 16:47:10,800 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:47:10,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:10,814 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:47:10,821 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 22 of 27 statements. [2025-01-09 16:47:10,821 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:47:10,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:10,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:47:10,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:10,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515450995] [2025-01-09 16:47:10,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515450995] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:10,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530117804] [2025-01-09 16:47:10,878 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:47:10,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:10,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:10,883 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:47:10,884 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:47:10,934 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:47:10,948 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 22 of 27 statements. [2025-01-09 16:47:10,948 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:47:10,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:10,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:47:10,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:47:11,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:47:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:47:11,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530117804] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:47:11,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:47:11,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-01-09 16:47:11,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151398300] [2025-01-09 16:47:11,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:47:11,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:47:11,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:11,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:47:11,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:47:11,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-01-09 16:47:11,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 257 flow. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 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:11,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:11,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-01-09 16:47:11,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:11,559 INFO L124 PetriNetUnfolderBase]: 911/1349 cut-off events. [2025-01-09 16:47:11,559 INFO L125 PetriNetUnfolderBase]: For 3609/3609 co-relation queries the response was YES. [2025-01-09 16:47:11,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5064 conditions, 1349 events. 911/1349 cut-off events. For 3609/3609 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5488 event pairs, 62 based on Foata normal form. 6/1139 useless extension candidates. Maximal degree in co-relation 5021. Up to 364 conditions per place. [2025-01-09 16:47:11,570 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 161 selfloop transitions, 47 changer transitions 0/209 dead transitions. [2025-01-09 16:47:11,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 209 transitions, 1706 flow [2025-01-09 16:47:11,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 16:47:11,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-09 16:47:11,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 200 transitions. [2025-01-09 16:47:11,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35650623885918004 [2025-01-09 16:47:11,571 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 257 flow. Second operand 17 states and 200 transitions. [2025-01-09 16:47:11,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 209 transitions, 1706 flow [2025-01-09 16:47:11,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 209 transitions, 1532 flow, removed 37 selfloop flow, removed 3 redundant places. [2025-01-09 16:47:11,582 INFO L231 Difference]: Finished difference. Result has 76 places, 95 transitions, 832 flow [2025-01-09 16:47:11,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=832, PETRI_PLACES=76, PETRI_TRANSITIONS=95} [2025-01-09 16:47:11,583 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2025-01-09 16:47:11,584 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 95 transitions, 832 flow [2025-01-09 16:47:11,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 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:11,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:11,584 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:11,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 16:47:11,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:11,785 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:47:11,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:11,786 INFO L85 PathProgramCache]: Analyzing trace with hash 506997525, now seen corresponding path program 5 times [2025-01-09 16:47:11,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:11,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945376010] [2025-01-09 16:47:11,786 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:47:11,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:11,799 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:47:11,810 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:11,813 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:47:11,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:11,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:47:11,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:11,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945376010] [2025-01-09 16:47:11,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945376010] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:11,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995827112] [2025-01-09 16:47:11,914 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:47:11,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:11,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:11,916 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:47:11,918 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:47:11,973 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:47:12,000 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,000 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:47:12,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:12,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:47:12,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:47:12,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:47:12,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995827112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:12,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:47:12,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2025-01-09 16:47:12,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32846628] [2025-01-09 16:47:12,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:12,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:47:12,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:12,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:47:12,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:47:12,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-01-09 16:47:12,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 95 transitions, 832 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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:12,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:12,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-01-09 16:47:12,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:12,333 INFO L124 PetriNetUnfolderBase]: 914/1365 cut-off events. [2025-01-09 16:47:12,333 INFO L125 PetriNetUnfolderBase]: For 8152/8152 co-relation queries the response was YES. [2025-01-09 16:47:12,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6429 conditions, 1365 events. 914/1365 cut-off events. For 8152/8152 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5366 event pairs, 350 based on Foata normal form. 3/1254 useless extension candidates. Maximal degree in co-relation 6364. Up to 1020 conditions per place. [2025-01-09 16:47:12,341 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 74 selfloop transitions, 54 changer transitions 10/139 dead transitions. [2025-01-09 16:47:12,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 139 transitions, 1411 flow [2025-01-09 16:47:12,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:47:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:47:12,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2025-01-09 16:47:12,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4069264069264069 [2025-01-09 16:47:12,345 INFO L175 Difference]: Start difference. First operand has 76 places, 95 transitions, 832 flow. Second operand 7 states and 94 transitions. [2025-01-09 16:47:12,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 139 transitions, 1411 flow [2025-01-09 16:47:12,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 139 transitions, 1353 flow, removed 24 selfloop flow, removed 1 redundant places. [2025-01-09 16:47:12,359 INFO L231 Difference]: Finished difference. Result has 85 places, 107 transitions, 1101 flow [2025-01-09 16:47:12,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1101, PETRI_PLACES=85, PETRI_TRANSITIONS=107} [2025-01-09 16:47:12,359 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 53 predicate places. [2025-01-09 16:47:12,359 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 107 transitions, 1101 flow [2025-01-09 16:47:12,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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:12,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:12,359 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:12,367 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:47:12,560 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,SelfDestructingSolverStorable6 [2025-01-09 16:47:12,560 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:47:12,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:12,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1941575025, now seen corresponding path program 6 times [2025-01-09 16:47:12,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:12,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466616109] [2025-01-09 16:47:12,561 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:47:12,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:12,570 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-01-09 16:47:12,575 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 22 of 27 statements. [2025-01-09 16:47:12,576 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:47:12,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:12,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 16:47:12,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:12,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466616109] [2025-01-09 16:47:12,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466616109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:12,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:12,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:47:12,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799678913] [2025-01-09 16:47:12,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:12,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:47:12,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:12,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:47:12,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:47:12,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-01-09 16:47:12,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 107 transitions, 1101 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:12,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:12,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-01-09 16:47:12,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:12,929 INFO L124 PetriNetUnfolderBase]: 927/1383 cut-off events. [2025-01-09 16:47:12,931 INFO L125 PetriNetUnfolderBase]: For 9390/9390 co-relation queries the response was YES. [2025-01-09 16:47:12,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7168 conditions, 1383 events. 927/1383 cut-off events. For 9390/9390 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5504 event pairs, 351 based on Foata normal form. 2/1271 useless extension candidates. Maximal degree in co-relation 7098. Up to 1039 conditions per place. [2025-01-09 16:47:12,940 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 97 selfloop transitions, 34 changer transitions 10/142 dead transitions. [2025-01-09 16:47:12,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 142 transitions, 1580 flow [2025-01-09 16:47:12,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:47:12,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:47:12,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-01-09 16:47:12,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-01-09 16:47:12,942 INFO L175 Difference]: Start difference. First operand has 85 places, 107 transitions, 1101 flow. Second operand 6 states and 88 transitions. [2025-01-09 16:47:12,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 142 transitions, 1580 flow [2025-01-09 16:47:12,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 142 transitions, 1378 flow, removed 53 selfloop flow, removed 6 redundant places. [2025-01-09 16:47:12,962 INFO L231 Difference]: Finished difference. Result has 83 places, 108 transitions, 1000 flow [2025-01-09 16:47:12,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1000, PETRI_PLACES=83, PETRI_TRANSITIONS=108} [2025-01-09 16:47:12,962 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 51 predicate places. [2025-01-09 16:47:12,962 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 108 transitions, 1000 flow [2025-01-09 16:47:12,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:12,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:12,963 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:12,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:47:12,963 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:47:12,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:12,963 INFO L85 PathProgramCache]: Analyzing trace with hash 350210591, now seen corresponding path program 7 times [2025-01-09 16:47:12,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:12,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825059934] [2025-01-09 16:47:12,963 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:47:12,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:12,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:47:12,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:47:12,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:12,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:13,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:47:13,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:13,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825059934] [2025-01-09 16:47:13,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825059934] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:13,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089973351] [2025-01-09 16:47:13,110 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:47:13,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:13,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:13,112 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:47:13,115 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:47:13,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:47:13,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:47:13,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:13,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:13,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:47:13,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:13,262 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:47:13,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:47:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:47:13,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089973351] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:13,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:47:13,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 15 [2025-01-09 16:47:13,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233262070] [2025-01-09 16:47:13,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:13,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:47:13,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:13,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:47:13,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:47:13,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-01-09 16:47:13,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 108 transitions, 1000 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:13,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-01-09 16:47:13,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:13,570 INFO L124 PetriNetUnfolderBase]: 887/1303 cut-off events. [2025-01-09 16:47:13,570 INFO L125 PetriNetUnfolderBase]: For 7596/7596 co-relation queries the response was YES. [2025-01-09 16:47:13,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6308 conditions, 1303 events. 887/1303 cut-off events. For 7596/7596 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4896 event pairs, 286 based on Foata normal form. 14/1203 useless extension candidates. Maximal degree in co-relation 6264. Up to 703 conditions per place. [2025-01-09 16:47:13,578 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 74 selfloop transitions, 56 changer transitions 0/131 dead transitions. [2025-01-09 16:47:13,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 131 transitions, 1350 flow [2025-01-09 16:47:13,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:47:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:47:13,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2025-01-09 16:47:13,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37662337662337664 [2025-01-09 16:47:13,579 INFO L175 Difference]: Start difference. First operand has 83 places, 108 transitions, 1000 flow. Second operand 7 states and 87 transitions. [2025-01-09 16:47:13,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 131 transitions, 1350 flow [2025-01-09 16:47:13,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 131 transitions, 1252 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-01-09 16:47:13,594 INFO L231 Difference]: Finished difference. Result has 83 places, 106 transitions, 1009 flow [2025-01-09 16:47:13,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1009, PETRI_PLACES=83, PETRI_TRANSITIONS=106} [2025-01-09 16:47:13,595 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 51 predicate places. [2025-01-09 16:47:13,595 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 106 transitions, 1009 flow [2025-01-09 16:47:13,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:13,596 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:13,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 16:47:13,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:13,796 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:47:13,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:13,797 INFO L85 PathProgramCache]: Analyzing trace with hash -490618427, now seen corresponding path program 1 times [2025-01-09 16:47:13,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:13,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963535850] [2025-01-09 16:47:13,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:13,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:13,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:47:13,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:47:13,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:13,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:14,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:47:14,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:14,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963535850] [2025-01-09 16:47:14,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963535850] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:14,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414578916] [2025-01-09 16:47:14,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:14,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:14,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:14,935 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:14,937 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:14,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:47:15,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:47:15,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:15,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:15,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-01-09 16:47:15,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:15,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 16:47:15,109 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 16:47:15,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-09 16:47:15,152 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2025-01-09 16:47:15,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2025-01-09 16:47:15,226 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2025-01-09 16:47:15,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2025-01-09 16:47:15,522 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 16:47:15,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2025-01-09 16:47:15,676 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 16:47:15,679 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 16:47:15,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 42 [2025-01-09 16:47:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:47:15,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:47:57,812 INFO L349 Elim1Store]: treesize reduction 102, result has 71.5 percent of original size [2025-01-09 16:47:57,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 2408 treesize of output 1247 [2025-01-09 16:47:57,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:47:57,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1168 treesize of output 1104 [2025-01-09 16:47:58,135 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 16:47:58,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 16:47:58,826 INFO L349 Elim1Store]: treesize reduction 8, result has 86.0 percent of original size [2025-01-09 16:47:58,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 78 [2025-01-09 16:47:59,027 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 16:47:59,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 17 [2025-01-09 16:47:59,197 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 16:47:59,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 17