./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-sum.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-three-array-sum.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 c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:48:50,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:48:50,495 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:48:50,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:48:50,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:48:50,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:48:50,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:48:50,530 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:48:50,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:48:50,530 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:48:50,530 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:48:50,530 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:48:50,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:48:50,531 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:48:50,531 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:48:50,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:48:50,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:48:50,531 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:48:50,531 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:48:50,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:48:50,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:48:50,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:48:50,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:48:50,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:48:50,533 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:48:50,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:48:50,533 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:48:50,534 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:48:50,534 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:48:50,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:48:50,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:48:50,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:48:50,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:48:50,535 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:48:50,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:48:50,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:48:50,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:48:50,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:48:50,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:48:50,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:48:50,535 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:48:50,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:48:50,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:48:50,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:48:50,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:48:50,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:48:50,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:48:50,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:48:50,536 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 -> c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e [2025-01-09 16:48:50,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:48:50,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:48:50,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:48:50,814 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:48:50,815 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:48:50,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2025-01-09 16:48:52,063 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/694659975/29201987c12843418c48415090a5559c/FLAG91cebf8e4 [2025-01-09 16:48:52,362 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:48:52,363 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2025-01-09 16:48:52,382 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/694659975/29201987c12843418c48415090a5559c/FLAG91cebf8e4 [2025-01-09 16:48:52,628 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/694659975/29201987c12843418c48415090a5559c [2025-01-09 16:48:52,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:48:52,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:48:52,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:48:52,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:48:52,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:48:52,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:48:52" (1/1) ... [2025-01-09 16:48:52,639 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ff57c44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:52, skipping insertion in model container [2025-01-09 16:48:52,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:48:52" (1/1) ... [2025-01-09 16:48:52,655 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:48:52,800 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-three-array-sum.wvr.c[2730,2743] [2025-01-09 16:48:52,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:48:52,816 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:48:52,839 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-three-array-sum.wvr.c[2730,2743] [2025-01-09 16:48:52,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:48:52,858 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:48:52,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:52 WrapperNode [2025-01-09 16:48:52,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:48:52,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:48:52,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:48:52,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:48:52,866 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:48:52" (1/1) ... [2025-01-09 16:48:52,873 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:48:52" (1/1) ... [2025-01-09 16:48:52,887 INFO L138 Inliner]: procedures = 25, calls = 29, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 129 [2025-01-09 16:48:52,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:48:52,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:48:52,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:48:52,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:48:52,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:52" (1/1) ... [2025-01-09 16:48:52,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:52" (1/1) ... [2025-01-09 16:48:52,898 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:52" (1/1) ... [2025-01-09 16:48:52,912 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-01-09 16:48:52,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:52" (1/1) ... [2025-01-09 16:48:52,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:52" (1/1) ... [2025-01-09 16:48:52,919 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:52" (1/1) ... [2025-01-09 16:48:52,920 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:52" (1/1) ... [2025-01-09 16:48:52,922 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:52" (1/1) ... [2025-01-09 16:48:52,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:52" (1/1) ... [2025-01-09 16:48:52,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:52" (1/1) ... [2025-01-09 16:48:52,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:48:52,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:48:52,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:48:52,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:48:52,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:52" (1/1) ... [2025-01-09 16:48:52,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:48:52,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:48:52,955 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:48:52,957 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:48:52,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:48:52,976 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:48:52,976 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:48:52,977 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:48:52,977 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:48:52,977 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:48:52,977 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:48:52,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:48:52,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:48:52,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:48:52,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:48:52,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:48:52,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:48:52,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:48:52,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:48:52,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:48:52,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:48:52,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:48:52,980 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:48:53,080 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:48:53,081 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:48:53,357 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:48:53,357 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:48:53,568 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:48:53,568 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:48:53,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:48:53 BoogieIcfgContainer [2025-01-09 16:48:53,568 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:48:53,571 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:48:53,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:48:53,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:48:53,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:48:52" (1/3) ... [2025-01-09 16:48:53,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8745e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:48:53, skipping insertion in model container [2025-01-09 16:48:53,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:48:52" (2/3) ... [2025-01-09 16:48:53,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8745e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:48:53, skipping insertion in model container [2025-01-09 16:48:53,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:48:53" (3/3) ... [2025-01-09 16:48:53,577 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2025-01-09 16:48:53,590 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:48:53,592 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-sum.wvr.c that has 4 procedures, 33 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-09 16:48:53,592 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:48:53,667 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:48:53,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 39 transitions, 99 flow [2025-01-09 16:48:53,733 INFO L124 PetriNetUnfolderBase]: 7/36 cut-off events. [2025-01-09 16:48:53,734 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:48:53,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 7/36 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-01-09 16:48:53,738 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 39 transitions, 99 flow [2025-01-09 16:48:53,742 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 35 transitions, 88 flow [2025-01-09 16:48:53,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:48:53,764 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;@2aa30907, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:48:53,765 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:48:53,778 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:48:53,778 INFO L124 PetriNetUnfolderBase]: 7/34 cut-off events. [2025-01-09 16:48:53,778 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:48:53,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:53,779 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:53,779 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:48:53,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:53,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1387882723, now seen corresponding path program 1 times [2025-01-09 16:48:53,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:53,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146760113] [2025-01-09 16:48:53,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:53,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:53,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 16:48:53,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 16:48:53,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:53,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:54,448 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:48:54,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:54,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146760113] [2025-01-09 16:48:54,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146760113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:48:54,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:48:54,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:48:54,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773337281] [2025-01-09 16:48:54,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:54,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:48:54,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:54,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:48:54,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:48:54,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2025-01-09 16:48:54,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:54,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:54,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2025-01-09 16:48:54,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:54,753 INFO L124 PetriNetUnfolderBase]: 638/1043 cut-off events. [2025-01-09 16:48:54,753 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-01-09 16:48:54,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2000 conditions, 1043 events. 638/1043 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4695 event pairs, 172 based on Foata normal form. 1/905 useless extension candidates. Maximal degree in co-relation 1709. Up to 535 conditions per place. [2025-01-09 16:48:54,768 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 42 selfloop transitions, 3 changer transitions 1/53 dead transitions. [2025-01-09 16:48:54,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 53 transitions, 231 flow [2025-01-09 16:48:54,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:48:54,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:48:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-01-09 16:48:54,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6581196581196581 [2025-01-09 16:48:54,782 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 88 flow. Second operand 3 states and 77 transitions. [2025-01-09 16:48:54,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 53 transitions, 231 flow [2025-01-09 16:48:54,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 53 transitions, 209 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:48:54,793 INFO L231 Difference]: Finished difference. Result has 35 places, 37 transitions, 95 flow [2025-01-09 16:48:54,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=35, PETRI_TRANSITIONS=37} [2025-01-09 16:48:54,798 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2025-01-09 16:48:54,798 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 37 transitions, 95 flow [2025-01-09 16:48:54,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:54,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:54,798 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:48:54,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:48:54,798 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:48:54,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:54,799 INFO L85 PathProgramCache]: Analyzing trace with hash -230599721, now seen corresponding path program 1 times [2025-01-09 16:48:54,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:54,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216520680] [2025-01-09 16:48:54,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:54,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:54,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:48:54,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:48:54,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:54,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:48:54,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:54,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216520680] [2025-01-09 16:48:54,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216520680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:48:54,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:48:54,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:48:54,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276572908] [2025-01-09 16:48:54,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:54,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:48:54,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:54,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:48:54,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:48:55,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2025-01-09 16:48:55,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 37 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:48:55,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:55,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2025-01-09 16:48:55,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:55,343 INFO L124 PetriNetUnfolderBase]: 1070/1919 cut-off events. [2025-01-09 16:48:55,343 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2025-01-09 16:48:55,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3698 conditions, 1919 events. 1070/1919 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10662 event pairs, 566 based on Foata normal form. 58/1855 useless extension candidates. Maximal degree in co-relation 1545. Up to 815 conditions per place. [2025-01-09 16:48:55,356 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 64 selfloop transitions, 15 changer transitions 0/86 dead transitions. [2025-01-09 16:48:55,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 86 transitions, 371 flow [2025-01-09 16:48:55,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:48:55,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:48:55,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2025-01-09 16:48:55,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5811965811965812 [2025-01-09 16:48:55,358 INFO L175 Difference]: Start difference. First operand has 35 places, 37 transitions, 95 flow. Second operand 6 states and 136 transitions. [2025-01-09 16:48:55,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 86 transitions, 371 flow [2025-01-09 16:48:55,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 86 transitions, 366 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:48:55,361 INFO L231 Difference]: Finished difference. Result has 43 places, 50 transitions, 196 flow [2025-01-09 16:48:55,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=43, PETRI_TRANSITIONS=50} [2025-01-09 16:48:55,362 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2025-01-09 16:48:55,362 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 50 transitions, 196 flow [2025-01-09 16:48:55,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:48:55,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:55,362 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] [2025-01-09 16:48:55,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:48:55,362 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:48:55,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:55,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2036832141, now seen corresponding path program 1 times [2025-01-09 16:48:55,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:55,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048272576] [2025-01-09 16:48:55,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:55,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:55,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:48:55,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:48:55,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:55,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:55,546 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:48:55,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:55,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048272576] [2025-01-09 16:48:55,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048272576] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:55,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867767945] [2025-01-09 16:48:55,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:55,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:55,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:48:55,550 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:48:55,552 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:48:55,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:48:55,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:48:55,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:55,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:55,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:48:55,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:48:55,724 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:48:55,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:48:55,781 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:48:55,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867767945] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:55,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:48:55,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-01-09 16:48:55,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303028258] [2025-01-09 16:48:55,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:55,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:48:55,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:55,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:48:55,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:48:55,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-01-09 16:48:55,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 50 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:55,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:55,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-01-09 16:48:55,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:56,270 INFO L124 PetriNetUnfolderBase]: 2124/3584 cut-off events. [2025-01-09 16:48:56,270 INFO L125 PetriNetUnfolderBase]: For 1814/1814 co-relation queries the response was YES. [2025-01-09 16:48:56,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7970 conditions, 3584 events. 2124/3584 cut-off events. For 1814/1814 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 20513 event pairs, 780 based on Foata normal form. 0/3217 useless extension candidates. Maximal degree in co-relation 3477. Up to 1155 conditions per place. [2025-01-09 16:48:56,299 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 85 selfloop transitions, 10 changer transitions 0/101 dead transitions. [2025-01-09 16:48:56,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 101 transitions, 556 flow [2025-01-09 16:48:56,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:48:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:48:56,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2025-01-09 16:48:56,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5683760683760684 [2025-01-09 16:48:56,301 INFO L175 Difference]: Start difference. First operand has 43 places, 50 transitions, 196 flow. Second operand 6 states and 133 transitions. [2025-01-09 16:48:56,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 101 transitions, 556 flow [2025-01-09 16:48:56,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 101 transitions, 556 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:48:56,306 INFO L231 Difference]: Finished difference. Result has 51 places, 56 transitions, 260 flow [2025-01-09 16:48:56,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=260, PETRI_PLACES=51, PETRI_TRANSITIONS=56} [2025-01-09 16:48:56,307 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2025-01-09 16:48:56,307 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 56 transitions, 260 flow [2025-01-09 16:48:56,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:56,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:56,307 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:48:56,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 16:48:56,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:56,508 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:48:56,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:56,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1991753284, now seen corresponding path program 1 times [2025-01-09 16:48:56,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:56,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060235031] [2025-01-09 16:48:56,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:56,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:56,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:48:56,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:48:56,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:56,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:56,655 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:48:56,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:56,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060235031] [2025-01-09 16:48:56,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060235031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:48:56,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:48:56,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:48:56,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982646486] [2025-01-09 16:48:56,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:56,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:48:56,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:56,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:48:56,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:48:56,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-01-09 16:48:56,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 56 transitions, 260 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:56,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:56,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-01-09 16:48:56,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:57,004 INFO L124 PetriNetUnfolderBase]: 1371/2234 cut-off events. [2025-01-09 16:48:57,004 INFO L125 PetriNetUnfolderBase]: For 1790/1790 co-relation queries the response was YES. [2025-01-09 16:48:57,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5824 conditions, 2234 events. 1371/2234 cut-off events. For 1790/1790 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 10771 event pairs, 793 based on Foata normal form. 0/2082 useless extension candidates. Maximal degree in co-relation 3741. Up to 1253 conditions per place. [2025-01-09 16:48:57,015 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 28 selfloop transitions, 6 changer transitions 44/85 dead transitions. [2025-01-09 16:48:57,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 85 transitions, 524 flow [2025-01-09 16:48:57,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:48:57,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:48:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2025-01-09 16:48:57,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5299145299145299 [2025-01-09 16:48:57,019 INFO L175 Difference]: Start difference. First operand has 51 places, 56 transitions, 260 flow. Second operand 6 states and 124 transitions. [2025-01-09 16:48:57,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 85 transitions, 524 flow [2025-01-09 16:48:57,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 85 transitions, 524 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:48:57,025 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 179 flow [2025-01-09 16:48:57,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2025-01-09 16:48:57,026 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2025-01-09 16:48:57,027 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 179 flow [2025-01-09 16:48:57,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:48:57,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:57,028 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:48:57,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:48:57,028 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:48:57,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:57,029 INFO L85 PathProgramCache]: Analyzing trace with hash -239070983, now seen corresponding path program 1 times [2025-01-09 16:48:57,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:57,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423538462] [2025-01-09 16:48:57,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:57,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:57,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:48:57,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:48:57,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:57,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:57,168 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:48:57,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:57,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423538462] [2025-01-09 16:48:57,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423538462] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:57,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362401259] [2025-01-09 16:48:57,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:57,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:57,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:48:57,173 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:48:57,175 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:48:57,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:48:57,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:48:57,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:57,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:57,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:48:57,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:48:57,362 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:48:57,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:48:57,426 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:48:57,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362401259] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:57,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:48:57,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-01-09 16:48:57,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559352820] [2025-01-09 16:48:57,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:57,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:48:57,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:57,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:48:57,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:48:57,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-01-09 16:48:57,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:48:57,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:57,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-01-09 16:48:57,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:57,629 INFO L124 PetriNetUnfolderBase]: 910/1560 cut-off events. [2025-01-09 16:48:57,629 INFO L125 PetriNetUnfolderBase]: For 1145/1145 co-relation queries the response was YES. [2025-01-09 16:48:57,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3929 conditions, 1560 events. 910/1560 cut-off events. For 1145/1145 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7677 event pairs, 290 based on Foata normal form. 72/1536 useless extension candidates. Maximal degree in co-relation 3901. Up to 647 conditions per place. [2025-01-09 16:48:57,641 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 41 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2025-01-09 16:48:57,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 321 flow [2025-01-09 16:48:57,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:48:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:48:57,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2025-01-09 16:48:57,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4461538461538462 [2025-01-09 16:48:57,644 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 179 flow. Second operand 5 states and 87 transitions. [2025-01-09 16:48:57,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 321 flow [2025-01-09 16:48:57,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 262 flow, removed 16 selfloop flow, removed 11 redundant places. [2025-01-09 16:48:57,650 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 155 flow [2025-01-09 16:48:57,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2025-01-09 16:48:57,651 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2025-01-09 16:48:57,651 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 155 flow [2025-01-09 16:48:57,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:48:57,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:57,651 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:57,660 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:48:57,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:57,855 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:48:57,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:57,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1904241446, now seen corresponding path program 1 times [2025-01-09 16:48:57,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:57,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698983067] [2025-01-09 16:48:57,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:57,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:57,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 16:48:57,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 16:48:57,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:57,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:58,008 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:48:58,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:58,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698983067] [2025-01-09 16:48:58,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698983067] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:58,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299623058] [2025-01-09 16:48:58,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:58,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:58,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:48:58,012 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:48:58,015 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:48:58,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 16:48:58,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 16:48:58,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:58,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:58,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:48:58,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:48:58,163 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:48:58,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:48:58,208 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:48:58,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299623058] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:58,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:48:58,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-01-09 16:48:58,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068612390] [2025-01-09 16:48:58,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:48:58,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:48:58,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:48:58,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:48:58,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:48:58,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2025-01-09 16:48:58,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:48:58,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:48:58,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2025-01-09 16:48:58,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:48:58,374 INFO L124 PetriNetUnfolderBase]: 687/1208 cut-off events. [2025-01-09 16:48:58,375 INFO L125 PetriNetUnfolderBase]: For 696/696 co-relation queries the response was YES. [2025-01-09 16:48:58,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 1208 events. 687/1208 cut-off events. For 696/696 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5635 event pairs, 328 based on Foata normal form. 62/1201 useless extension candidates. Maximal degree in co-relation 2902. Up to 709 conditions per place. [2025-01-09 16:48:58,383 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 43 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2025-01-09 16:48:58,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 57 transitions, 307 flow [2025-01-09 16:48:58,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:48:58,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:48:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2025-01-09 16:48:58,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48205128205128206 [2025-01-09 16:48:58,385 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 155 flow. Second operand 5 states and 94 transitions. [2025-01-09 16:48:58,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 57 transitions, 307 flow [2025-01-09 16:48:58,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 299 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:48:58,388 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 170 flow [2025-01-09 16:48:58,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2025-01-09 16:48:58,389 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2025-01-09 16:48:58,389 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 170 flow [2025-01-09 16:48:58,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:48:58,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:48:58,389 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:48:58,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:48:58,590 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:48:58,590 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:48:58,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:48:58,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1741245402, now seen corresponding path program 1 times [2025-01-09 16:48:58,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:48:58,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977732408] [2025-01-09 16:48:58,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:58,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:48:58,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 16:48:58,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 16:48:58,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:48:58,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:48:59,948 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:48:59,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:48:59,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977732408] [2025-01-09 16:48:59,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977732408] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:48:59,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895810523] [2025-01-09 16:48:59,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:48:59,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:48:59,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:48:59,951 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:48:59,956 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:49:00,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 16:49:00,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 16:49:00,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:49:00,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:49:00,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 16:49:00,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:49:00,329 INFO L349 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2025-01-09 16:49:00,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 58 [2025-01-09 16:49:01,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:49:01,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 107 treesize of output 499 [2025-01-09 16:49:07,142 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:49:07,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:49:51,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:49:51,005 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 38 treesize of output 83 [2025-01-09 16:49:51,755 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:49:51,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895810523] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:49:51,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:49:51,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 7] total 25 [2025-01-09 16:49:51,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90654193] [2025-01-09 16:49:51,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:49:51,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 16:49:51,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:49:51,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 16:49:51,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=547, Unknown=4, NotChecked=0, Total=650 [2025-01-09 16:49:55,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 16:49:59,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 16:50:03,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 16:50:03,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2025-01-09 16:50:03,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 170 flow. Second operand has 26 states, 26 states have (on average 10.423076923076923) internal successors, (271), 26 states have internal predecessors, (271), 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:50:03,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:50:03,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2025-01-09 16:50:03,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:50:05,815 INFO L124 PetriNetUnfolderBase]: 2493/3878 cut-off events. [2025-01-09 16:50:05,816 INFO L125 PetriNetUnfolderBase]: For 3708/3724 co-relation queries the response was YES. [2025-01-09 16:50:05,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10639 conditions, 3878 events. 2493/3878 cut-off events. For 3708/3724 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 19218 event pairs, 72 based on Foata normal form. 1/3754 useless extension candidates. Maximal degree in co-relation 10595. Up to 1636 conditions per place. [2025-01-09 16:50:05,839 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 160 selfloop transitions, 47 changer transitions 1/212 dead transitions. [2025-01-09 16:50:05,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 212 transitions, 1207 flow [2025-01-09 16:50:05,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 16:50:05,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-09 16:50:05,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 323 transitions. [2025-01-09 16:50:05,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4601139601139601 [2025-01-09 16:50:05,844 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 170 flow. Second operand 18 states and 323 transitions. [2025-01-09 16:50:05,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 212 transitions, 1207 flow [2025-01-09 16:50:05,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 212 transitions, 1187 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-09 16:50:05,850 INFO L231 Difference]: Finished difference. Result has 74 places, 88 transitions, 562 flow [2025-01-09 16:50:05,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=562, PETRI_PLACES=74, PETRI_TRANSITIONS=88} [2025-01-09 16:50:05,852 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 36 predicate places. [2025-01-09 16:50:05,852 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 88 transitions, 562 flow [2025-01-09 16:50:05,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.423076923076923) internal successors, (271), 26 states have internal predecessors, (271), 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:50:05,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:50:05,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:50:05,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 16:50:06,058 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:50:06,058 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:50:06,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:50:06,059 INFO L85 PathProgramCache]: Analyzing trace with hash 695079264, now seen corresponding path program 2 times [2025-01-09 16:50:06,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:50:06,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007724759] [2025-01-09 16:50:06,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:50:06,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:50:06,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-09 16:50:06,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 16:50:06,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:50:06,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:07,572 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:50:07,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:50:07,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007724759] [2025-01-09 16:50:07,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007724759] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:50:07,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508098711] [2025-01-09 16:50:07,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:50:07,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:50:07,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:50:07,574 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:50:07,575 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:50:07,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-01-09 16:50:07,660 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 16:50:07,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:50:07,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:50:07,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-09 16:50:07,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:50:07,674 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:50:07,717 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 16:50:07,717 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:50:07,762 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-01-09 16:50:07,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-01-09 16:50:07,994 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 16:50:07,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2025-01-09 16:50:08,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:50:08,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 23 [2025-01-09 16:50:08,472 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:50:08,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:50:08,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:50:08,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 316 treesize of output 296 [2025-01-09 16:50:09,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 57 [2025-01-09 16:50:10,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:50:10,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 75 [2025-01-09 16:50:10,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2025-01-09 16:50:10,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 61 [2025-01-09 16:50:10,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 89