/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:21:13,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:21:13,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 01:21:13,478 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:21:13,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:21:13,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:21:13,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:21:13,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:21:13,501 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:21:13,501 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:21:13,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:21:13,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:21:13,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:21:13,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:21:13,502 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:21:13,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:21:13,503 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:21:13,503 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:21:13,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:21:13,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:21:13,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:21:13,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:21:13,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:21:13,503 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:21:13,503 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:21:13,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:21:13,503 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:21:13,503 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:21:13,503 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:21:13,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:21:13,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:21:13,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:21:13,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:21:13,504 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:21:13,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:21:13,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:21:13,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:21:13,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:21:13,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:21:13,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:21:13,504 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:21:13,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:21:13,504 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:21:13,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:21:13,505 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:21:13,505 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:21:13,505 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:21:13,505 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:21:13,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:21:13,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:21:13,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:21:13,722 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:21:13,723 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:21:13,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c [2025-04-14 01:21:15,000 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90b16da3f/f635e27c2f6b489a938b7fa7dbf4cd0b/FLAG8fdeacbdf [2025-04-14 01:21:15,196 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:21:15,197 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c [2025-04-14 01:21:15,204 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90b16da3f/f635e27c2f6b489a938b7fa7dbf4cd0b/FLAG8fdeacbdf [2025-04-14 01:21:16,050 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90b16da3f/f635e27c2f6b489a938b7fa7dbf4cd0b [2025-04-14 01:21:16,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:21:16,053 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:21:16,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:21:16,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:21:16,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:21:16,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:21:16" (1/1) ... [2025-04-14 01:21:16,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@599c92ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:21:16, skipping insertion in model container [2025-04-14 01:21:16,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:21:16" (1/1) ... [2025-04-14 01:21:16,073 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:21:16,237 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c[2637,2650] [2025-04-14 01:21:16,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:21:16,255 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:21:16,283 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c[2637,2650] [2025-04-14 01:21:16,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:21:16,297 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:21:16,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:21:16 WrapperNode [2025-04-14 01:21:16,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:21:16,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:21:16,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:21:16,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:21:16,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:21:16" (1/1) ... [2025-04-14 01:21:16,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:21:16" (1/1) ... [2025-04-14 01:21:16,332 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 11, calls inlined = 17, statements flattened = 173 [2025-04-14 01:21:16,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:21:16,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:21:16,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:21:16,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:21:16,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:21:16" (1/1) ... [2025-04-14 01:21:16,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:21:16" (1/1) ... [2025-04-14 01:21:16,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:21:16" (1/1) ... [2025-04-14 01:21:16,357 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2025-04-14 01:21:16,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:21:16" (1/1) ... [2025-04-14 01:21:16,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:21:16" (1/1) ... [2025-04-14 01:21:16,362 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:21:16" (1/1) ... [2025-04-14 01:21:16,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:21:16" (1/1) ... [2025-04-14 01:21:16,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:21:16" (1/1) ... [2025-04-14 01:21:16,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:21:16" (1/1) ... [2025-04-14 01:21:16,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:21:16,368 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:21:16,368 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:21:16,368 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:21:16,368 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:21:16" (1/1) ... [2025-04-14 01:21:16,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:21:16,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:16,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 01:21:16,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 01:21:16,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:21:16,413 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:21:16,413 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:21:16,413 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:21:16,413 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:21:16,413 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 01:21:16,413 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 01:21:16,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:21:16,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:21:16,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:21:16,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:21:16,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 01:21:16,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:21:16,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:21:16,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:21:16,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:21:16,415 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:21:16,496 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:21:16,498 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:21:16,776 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:21:16,776 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:21:16,776 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:21:17,038 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:21:17,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:21:17 BoogieIcfgContainer [2025-04-14 01:21:17,039 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:21:17,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:21:17,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:21:17,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:21:17,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:21:16" (1/3) ... [2025-04-14 01:21:17,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af0b2b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:21:17, skipping insertion in model container [2025-04-14 01:21:17,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:21:16" (2/3) ... [2025-04-14 01:21:17,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af0b2b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:21:17, skipping insertion in model container [2025-04-14 01:21:17,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:21:17" (3/3) ... [2025-04-14 01:21:17,047 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2025-04-14 01:21:17,057 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:21:17,058 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-vector-add.wvr.c that has 4 procedures, 26 locations, 29 edges, 1 initial locations, 7 loop locations, and 1 error locations. [2025-04-14 01:21:17,058 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:21:17,097 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 01:21:17,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 85 flow [2025-04-14 01:21:17,144 INFO L116 PetriNetUnfolderBase]: 7/29 cut-off events. [2025-04-14 01:21:17,146 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:21:17,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 7/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-04-14 01:21:17,148 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 85 flow [2025-04-14 01:21:17,153 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 74 flow [2025-04-14 01:21:17,159 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:21:17,169 INFO L340 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;@c1c37eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:21:17,169 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 01:21:17,182 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:21:17,183 INFO L116 PetriNetUnfolderBase]: 7/27 cut-off events. [2025-04-14 01:21:17,183 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:21:17,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:17,183 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-04-14 01:21:17,184 INFO L403 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-04-14 01:21:17,187 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:17,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1937698108, now seen corresponding path program 1 times [2025-04-14 01:21:17,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:17,193 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336791906] [2025-04-14 01:21:17,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:21:17,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:17,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 01:21:17,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:21:17,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:21:17,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:17,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:21:17,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:17,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336791906] [2025-04-14 01:21:17,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336791906] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:21:17,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:21:17,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:21:17,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705355753] [2025-04-14 01:21:17,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:17,682 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:21:17,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:17,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:21:17,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:21:17,705 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:17,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-04-14 01:21:17,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:17,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:17,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:17,921 INFO L116 PetriNetUnfolderBase]: 411/610 cut-off events. [2025-04-14 01:21:17,921 INFO L117 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-04-14 01:21:17,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 610 events. 411/610 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1675 event pairs, 248 based on Foata normal form. 1/447 useless extension candidates. Maximal degree in co-relation 534. Up to 301 conditions per place. [2025-04-14 01:21:17,926 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 24 selfloop transitions, 8 changer transitions 34/66 dead transitions. [2025-04-14 01:21:17,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 66 transitions, 300 flow [2025-04-14 01:21:17,928 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:21:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:21:17,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2025-04-14 01:21:17,950 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5125 [2025-04-14 01:21:17,953 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 74 flow. Second operand 5 states and 82 transitions. [2025-04-14 01:21:17,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 66 transitions, 300 flow [2025-04-14 01:21:17,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 66 transitions, 276 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 01:21:17,960 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 114 flow [2025-04-14 01:21:17,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=32, PETRI_TRANSITIONS=32} [2025-04-14 01:21:17,967 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2025-04-14 01:21:17,967 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 114 flow [2025-04-14 01:21:17,968 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-04-14 01:21:17,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:17,968 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-04-14 01:21:17,968 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:21:17,968 INFO L403 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-04-14 01:21:17,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:17,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1956459680, now seen corresponding path program 1 times [2025-04-14 01:21:17,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:17,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314828585] [2025-04-14 01:21:17,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:21:17,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:17,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:21:17,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:21:18,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:21:18,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:18,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:18,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:18,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314828585] [2025-04-14 01:21:18,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314828585] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:18,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297382392] [2025-04-14 01:21:18,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:21:18,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:18,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:18,181 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:21:18,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 01:21:18,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:21:18,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:21:18,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:21:18,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:18,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:21:18,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:18,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:18,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:21:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:18,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297382392] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:18,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:21:18,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-04-14 01:21:18,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083295477] [2025-04-14 01:21:18,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:18,384 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:21:18,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:18,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:21:18,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:21:18,384 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:18,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-04-14 01:21:18,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:18,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:18,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:18,519 INFO L116 PetriNetUnfolderBase]: 262/389 cut-off events. [2025-04-14 01:21:18,519 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-14 01:21:18,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 389 events. 262/389 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1018 event pairs, 124 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 814. Up to 303 conditions per place. [2025-04-14 01:21:18,521 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 40 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2025-04-14 01:21:18,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 228 flow [2025-04-14 01:21:18,522 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:21:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:21:18,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2025-04-14 01:21:18,522 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35625 [2025-04-14 01:21:18,523 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 114 flow. Second operand 5 states and 57 transitions. [2025-04-14 01:21:18,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 44 transitions, 228 flow [2025-04-14 01:21:18,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 44 transitions, 210 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-14 01:21:18,527 INFO L231 Difference]: Finished difference. Result has 32 places, 33 transitions, 112 flow [2025-04-14 01:21:18,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=32, PETRI_TRANSITIONS=33} [2025-04-14 01:21:18,528 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2025-04-14 01:21:18,528 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 33 transitions, 112 flow [2025-04-14 01:21:18,528 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-04-14 01:21:18,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:18,528 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:18,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 01:21:18,728 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:18,729 INFO L403 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-04-14 01:21:18,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:18,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1490366115, now seen corresponding path program 1 times [2025-04-14 01:21:18,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:18,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266149561] [2025-04-14 01:21:18,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:21:18,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:18,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:21:18,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:21:18,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:21:18,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:21:18,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:18,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266149561] [2025-04-14 01:21:18,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266149561] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:18,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122814878] [2025-04-14 01:21:18,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:21:18,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:18,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:18,939 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:21:18,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 01:21:19,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:21:19,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:21:19,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:21:19,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:19,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:21:19,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:21:19,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:21:19,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:21:19,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122814878] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:19,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:21:19,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2025-04-14 01:21:19,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225308168] [2025-04-14 01:21:19,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:19,198 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:21:19,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:19,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:21:19,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-14 01:21:19,198 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:19,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 112 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-04-14 01:21:19,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:19,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:19,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:19,416 INFO L116 PetriNetUnfolderBase]: 443/655 cut-off events. [2025-04-14 01:21:19,417 INFO L117 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2025-04-14 01:21:19,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1575 conditions, 655 events. 443/655 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2072 event pairs, 169 based on Foata normal form. 0/490 useless extension candidates. Maximal degree in co-relation 1529. Up to 388 conditions per place. [2025-04-14 01:21:19,423 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 61 selfloop transitions, 7 changer transitions 0/68 dead transitions. [2025-04-14 01:21:19,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 68 transitions, 356 flow [2025-04-14 01:21:19,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:21:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:21:19,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2025-04-14 01:21:19,425 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3705357142857143 [2025-04-14 01:21:19,425 INFO L175 Difference]: Start difference. First operand has 32 places, 33 transitions, 112 flow. Second operand 7 states and 83 transitions. [2025-04-14 01:21:19,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 68 transitions, 356 flow [2025-04-14 01:21:19,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 68 transitions, 336 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-14 01:21:19,428 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 144 flow [2025-04-14 01:21:19,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=144, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-04-14 01:21:19,429 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2025-04-14 01:21:19,429 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 144 flow [2025-04-14 01:21:19,429 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-04-14 01:21:19,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:19,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:19,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 01:21:19,634 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-14 01:21:19,634 INFO L403 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-04-14 01:21:19,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:19,635 INFO L85 PathProgramCache]: Analyzing trace with hash 788168533, now seen corresponding path program 2 times [2025-04-14 01:21:19,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:19,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962431441] [2025-04-14 01:21:19,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:21:19,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:19,648 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:21:19,663 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 26 statements. [2025-04-14 01:21:19,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:21:19,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:19,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 01:21:19,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:19,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962431441] [2025-04-14 01:21:19,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962431441] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:21:19,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:21:19,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:21:19,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103841787] [2025-04-14 01:21:19,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:19,744 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:21:19,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:19,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:21:19,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:21:19,745 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:19,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 144 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:19,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:19,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:19,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:19,999 INFO L116 PetriNetUnfolderBase]: 693/1023 cut-off events. [2025-04-14 01:21:19,999 INFO L117 PetriNetUnfolderBase]: For 601/601 co-relation queries the response was YES. [2025-04-14 01:21:20,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2970 conditions, 1023 events. 693/1023 cut-off events. For 601/601 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3597 event pairs, 291 based on Foata normal form. 1/805 useless extension candidates. Maximal degree in co-relation 2921. Up to 642 conditions per place. [2025-04-14 01:21:20,004 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 65 selfloop transitions, 7 changer transitions 9/81 dead transitions. [2025-04-14 01:21:20,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 81 transitions, 466 flow [2025-04-14 01:21:20,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:21:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:21:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2025-04-14 01:21:20,006 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4322916666666667 [2025-04-14 01:21:20,006 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 144 flow. Second operand 6 states and 83 transitions. [2025-04-14 01:21:20,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 81 transitions, 466 flow [2025-04-14 01:21:20,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 81 transitions, 445 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-14 01:21:20,009 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 184 flow [2025-04-14 01:21:20,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2025-04-14 01:21:20,009 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2025-04-14 01:21:20,009 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 184 flow [2025-04-14 01:21:20,010 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:20,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:20,010 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:20,010 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:21:20,010 INFO L403 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-04-14 01:21:20,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:20,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1866280269, now seen corresponding path program 3 times [2025-04-14 01:21:20,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:20,010 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805649700] [2025-04-14 01:21:20,011 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:21:20,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:20,023 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:21:20,033 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 26 statements. [2025-04-14 01:21:20,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:21:20,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:20,121 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 01:21:20,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:20,121 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805649700] [2025-04-14 01:21:20,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805649700] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:21:20,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:21:20,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:21:20,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263733749] [2025-04-14 01:21:20,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:20,122 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:21:20,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:20,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:21:20,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:21:20,122 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:20,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:20,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:20,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:20,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:20,313 INFO L116 PetriNetUnfolderBase]: 748/1097 cut-off events. [2025-04-14 01:21:20,313 INFO L117 PetriNetUnfolderBase]: For 1213/1213 co-relation queries the response was YES. [2025-04-14 01:21:20,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3669 conditions, 1097 events. 748/1097 cut-off events. For 1213/1213 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3888 event pairs, 366 based on Foata normal form. 1/922 useless extension candidates. Maximal degree in co-relation 3645. Up to 827 conditions per place. [2025-04-14 01:21:20,321 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 61 selfloop transitions, 11 changer transitions 9/81 dead transitions. [2025-04-14 01:21:20,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 512 flow [2025-04-14 01:21:20,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:21:20,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:21:20,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2025-04-14 01:21:20,323 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4322916666666667 [2025-04-14 01:21:20,323 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 184 flow. Second operand 6 states and 83 transitions. [2025-04-14 01:21:20,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 81 transitions, 512 flow [2025-04-14 01:21:20,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 81 transitions, 486 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-04-14 01:21:20,329 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 255 flow [2025-04-14 01:21:20,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=255, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2025-04-14 01:21:20,330 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2025-04-14 01:21:20,330 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 255 flow [2025-04-14 01:21:20,330 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:20,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:20,330 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:20,330 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:21:20,330 INFO L403 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-04-14 01:21:20,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:20,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1165023509, now seen corresponding path program 4 times [2025-04-14 01:21:20,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:20,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683313786] [2025-04-14 01:21:20,331 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:21:20,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:20,339 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:21:20,343 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 26 statements. [2025-04-14 01:21:20,343 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 01:21:20,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:21:20,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:20,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683313786] [2025-04-14 01:21:20,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683313786] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:20,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944011378] [2025-04-14 01:21:20,401 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:21:20,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:20,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:20,403 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:21:20,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 01:21:20,460 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:21:20,478 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 26 statements. [2025-04-14 01:21:20,478 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 01:21:20,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:20,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:21:20,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:20,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:21:20,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:21:20,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:21:20,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944011378] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:21:20,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:21:20,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-04-14 01:21:20,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725723917] [2025-04-14 01:21:20,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:21:20,577 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:21:20,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:20,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:21:20,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:21:20,578 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:20,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 255 flow. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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-04-14 01:21:20,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:20,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:20,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:21,060 INFO L116 PetriNetUnfolderBase]: 911/1342 cut-off events. [2025-04-14 01:21:21,061 INFO L117 PetriNetUnfolderBase]: For 3654/3654 co-relation queries the response was YES. [2025-04-14 01:21:21,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5057 conditions, 1342 events. 911/1342 cut-off events. For 3654/3654 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5480 event pairs, 62 based on Foata normal form. 6/1132 useless extension candidates. Maximal degree in co-relation 5021. Up to 364 conditions per place. [2025-04-14 01:21:21,081 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 161 selfloop transitions, 47 changer transitions 0/208 dead transitions. [2025-04-14 01:21:21,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 208 transitions, 1704 flow [2025-04-14 01:21:21,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 01:21:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 01:21:21,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 183 transitions. [2025-04-14 01:21:21,086 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33639705882352944 [2025-04-14 01:21:21,086 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 255 flow. Second operand 17 states and 183 transitions. [2025-04-14 01:21:21,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 208 transitions, 1704 flow [2025-04-14 01:21:21,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 208 transitions, 1530 flow, removed 37 selfloop flow, removed 3 redundant places. [2025-04-14 01:21:21,095 INFO L231 Difference]: Finished difference. Result has 75 places, 94 transitions, 830 flow [2025-04-14 01:21:21,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=830, PETRI_PLACES=75, PETRI_TRANSITIONS=94} [2025-04-14 01:21:21,096 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 44 predicate places. [2025-04-14 01:21:21,096 INFO L485 AbstractCegarLoop]: Abstraction has has 75 places, 94 transitions, 830 flow [2025-04-14 01:21:21,096 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 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-04-14 01:21:21,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:21,096 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:21,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 01:21:21,297 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:21,297 INFO L403 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-04-14 01:21:21,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:21,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1006559571, now seen corresponding path program 5 times [2025-04-14 01:21:21,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:21,298 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460383101] [2025-04-14 01:21:21,298 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:21:21,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:21,306 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:21:21,318 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:21:21,318 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:21:21,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:21:21,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:21,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460383101] [2025-04-14 01:21:21,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460383101] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:21,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464077882] [2025-04-14 01:21:21,411 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:21:21,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:21,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:21,414 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:21:21,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 01:21:21,473 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:21:21,499 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:21:21,499 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:21:21,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:21,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:21:21,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:21,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:21:21,554 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:21:21,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464077882] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:21:21,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:21:21,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2025-04-14 01:21:21,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339036520] [2025-04-14 01:21:21,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:21,555 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:21:21,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:21,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:21:21,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:21:21,555 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:21,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 94 transitions, 830 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-04-14 01:21:21,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:21,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:21,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:21,803 INFO L116 PetriNetUnfolderBase]: 914/1358 cut-off events. [2025-04-14 01:21:21,803 INFO L117 PetriNetUnfolderBase]: For 8085/8085 co-relation queries the response was YES. [2025-04-14 01:21:21,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6422 conditions, 1358 events. 914/1358 cut-off events. For 8085/8085 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5341 event pairs, 350 based on Foata normal form. 3/1247 useless extension candidates. Maximal degree in co-relation 6357. Up to 1020 conditions per place. [2025-04-14 01:21:21,812 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 74 selfloop transitions, 54 changer transitions 10/138 dead transitions. [2025-04-14 01:21:21,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 138 transitions, 1409 flow [2025-04-14 01:21:21,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:21:21,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:21:21,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2025-04-14 01:21:21,813 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38839285714285715 [2025-04-14 01:21:21,813 INFO L175 Difference]: Start difference. First operand has 75 places, 94 transitions, 830 flow. Second operand 7 states and 87 transitions. [2025-04-14 01:21:21,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 138 transitions, 1409 flow [2025-04-14 01:21:21,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 138 transitions, 1351 flow, removed 24 selfloop flow, removed 1 redundant places. [2025-04-14 01:21:21,831 INFO L231 Difference]: Finished difference. Result has 84 places, 106 transitions, 1099 flow [2025-04-14 01:21:21,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1099, PETRI_PLACES=84, PETRI_TRANSITIONS=106} [2025-04-14 01:21:21,832 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 53 predicate places. [2025-04-14 01:21:21,832 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 106 transitions, 1099 flow [2025-04-14 01:21:21,832 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-04-14 01:21:21,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:21,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:21,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-14 01:21:22,034 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:22,034 INFO L403 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-04-14 01:21:22,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:22,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1965565881, now seen corresponding path program 6 times [2025-04-14 01:21:22,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:22,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218658442] [2025-04-14 01:21:22,035 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:21:22,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:22,047 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-14 01:21:22,057 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 21 of 26 statements. [2025-04-14 01:21:22,057 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:21:22,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:22,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-14 01:21:22,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:22,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218658442] [2025-04-14 01:21:22,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218658442] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:21:22,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:21:22,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:21:22,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676506725] [2025-04-14 01:21:22,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:22,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:21:22,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:22,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:21:22,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:21:22,131 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:22,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 106 transitions, 1099 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:22,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:22,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:22,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:22,338 INFO L116 PetriNetUnfolderBase]: 927/1377 cut-off events. [2025-04-14 01:21:22,339 INFO L117 PetriNetUnfolderBase]: For 9594/9594 co-relation queries the response was YES. [2025-04-14 01:21:22,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7162 conditions, 1377 events. 927/1377 cut-off events. For 9594/9594 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5493 event pairs, 351 based on Foata normal form. 2/1265 useless extension candidates. Maximal degree in co-relation 7092. Up to 1039 conditions per place. [2025-04-14 01:21:22,348 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 97 selfloop transitions, 34 changer transitions 10/141 dead transitions. [2025-04-14 01:21:22,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 141 transitions, 1578 flow [2025-04-14 01:21:22,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:21:22,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:21:22,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2025-04-14 01:21:22,350 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2025-04-14 01:21:22,350 INFO L175 Difference]: Start difference. First operand has 84 places, 106 transitions, 1099 flow. Second operand 6 states and 82 transitions. [2025-04-14 01:21:22,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 141 transitions, 1578 flow [2025-04-14 01:21:22,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 141 transitions, 1376 flow, removed 53 selfloop flow, removed 6 redundant places. [2025-04-14 01:21:22,372 INFO L231 Difference]: Finished difference. Result has 82 places, 107 transitions, 998 flow [2025-04-14 01:21:22,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=998, PETRI_PLACES=82, PETRI_TRANSITIONS=107} [2025-04-14 01:21:22,373 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 51 predicate places. [2025-04-14 01:21:22,373 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 107 transitions, 998 flow [2025-04-14 01:21:22,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:22,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:22,373 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:22,373 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 01:21:22,373 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:21:22,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:22,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1451529503, now seen corresponding path program 7 times [2025-04-14 01:21:22,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:22,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419552878] [2025-04-14 01:21:22,374 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:21:22,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:22,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:21:22,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:21:22,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:21:22,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:22,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:21:22,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:22,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419552878] [2025-04-14 01:21:22,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419552878] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:22,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387583370] [2025-04-14 01:21:22,512 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:21:22,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:22,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:22,515 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:21:22,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 01:21:22,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 01:21:22,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 01:21:22,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:21:22,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:22,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:21:22,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:21:22,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:21:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:21:22,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387583370] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:22,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:21:22,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 14 [2025-04-14 01:21:22,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668278500] [2025-04-14 01:21:22,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:22,760 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:21:22,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:22,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:21:22,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-04-14 01:21:22,761 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:22,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 107 transitions, 998 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-04-14 01:21:22,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:22,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:22,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:22,994 INFO L116 PetriNetUnfolderBase]: 887/1299 cut-off events. [2025-04-14 01:21:22,994 INFO L117 PetriNetUnfolderBase]: For 7449/7449 co-relation queries the response was YES. [2025-04-14 01:21:22,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6304 conditions, 1299 events. 887/1299 cut-off events. For 7449/7449 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4889 event pairs, 286 based on Foata normal form. 14/1199 useless extension candidates. Maximal degree in co-relation 6264. Up to 703 conditions per place. [2025-04-14 01:21:23,003 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 74 selfloop transitions, 56 changer transitions 0/130 dead transitions. [2025-04-14 01:21:23,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 130 transitions, 1348 flow [2025-04-14 01:21:23,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:21:23,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:21:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2025-04-14 01:21:23,005 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2025-04-14 01:21:23,005 INFO L175 Difference]: Start difference. First operand has 82 places, 107 transitions, 998 flow. Second operand 7 states and 80 transitions. [2025-04-14 01:21:23,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 130 transitions, 1348 flow [2025-04-14 01:21:23,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 130 transitions, 1250 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-04-14 01:21:23,022 INFO L231 Difference]: Finished difference. Result has 82 places, 105 transitions, 1007 flow [2025-04-14 01:21:23,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1007, PETRI_PLACES=82, PETRI_TRANSITIONS=105} [2025-04-14 01:21:23,022 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 51 predicate places. [2025-04-14 01:21:23,022 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 105 transitions, 1007 flow [2025-04-14 01:21:23,023 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-04-14 01:21:23,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:23,024 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-04-14 01:21:23,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 01:21:23,224 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:23,224 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:21:23,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:23,225 INFO L85 PathProgramCache]: Analyzing trace with hash 953402347, now seen corresponding path program 1 times [2025-04-14 01:21:23,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:23,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034449952] [2025-04-14 01:21:23,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:21:23,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:23,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:21:23,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:21:23,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:21:23,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:24,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:21:24,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:24,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034449952] [2025-04-14 01:21:24,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034449952] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:24,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900896492] [2025-04-14 01:21:24,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:21:24,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:24,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:24,443 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:21:24,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 01:21:24,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:21:24,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:21:24,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:21:24,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:24,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-14 01:21:24,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:24,563 INFO L354 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-04-14 01:21:24,617 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-14 01:21:24,617 INFO L354 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-04-14 01:21:24,666 INFO L325 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-04-14 01:21:24,667 INFO L354 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-04-14 01:21:24,824 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-14 01:21:24,824 INFO L354 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-04-14 01:21:25,001 INFO L325 Elim1Store]: treesize reduction 54, result has 48.1 percent of original size [2025-04-14 01:21:25,001 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 64 [2025-04-14 01:21:25,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:21:25,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:21:59,622 INFO L325 Elim1Store]: treesize reduction 102, result has 71.5 percent of original size [2025-04-14 01:21:59,623 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 1710 treesize of output 1005 [2025-04-14 01:21:59,728 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:21:59,728 INFO L354 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 1090 treesize of output 1042 [2025-04-14 01:21:59,944 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-14 01:21:59,944 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 17 [2025-04-14 01:22:00,236 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-14 01:22:00,237 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2025-04-14 01:22:00,409 INFO L325 Elim1Store]: treesize reduction 8, result has 86.0 percent of original size [2025-04-14 01:22:00,409 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 78 [2025-04-14 01:22:00,642 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-14 01:22:00,642 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2025-04-14 01:22:10,416 INFO L325 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2025-04-14 01:22:10,416 INFO L354 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 231 treesize of output 227 [2025-04-14 01:22:11,442 INFO L325 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2025-04-14 01:22:11,442 INFO L354 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 124 treesize of output 132 [2025-04-14 01:22:12,315 INFO L354 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 221 treesize of output 197 [2025-04-14 01:22:13,002 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:22:13,002 INFO L354 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 110 treesize of output 126 [2025-04-14 01:22:13,885 INFO L354 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 501 treesize of output 453 [2025-04-14 01:22:22,217 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:22:22,217 INFO L354 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 257 treesize of output 261 [2025-04-14 01:22:26,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:22:26,781 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 01:22:26,782 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2025-04-14 01:22:27,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:22:27,124 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 01:22:27,125 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2025-04-14 01:22:27,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:22:27,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:22:27,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:22:27,777 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 01:22:27,777 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 78 [2025-04-14 01:22:28,039 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:22:28,039 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 2390 treesize of output 2116 [2025-04-14 01:24:50,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:24:50,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900896492] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:24:50,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:24:50,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 30 [2025-04-14 01:24:50,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449581897] [2025-04-14 01:24:50,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:24:50,460 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-14 01:24:50,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:24:50,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-14 01:24:50,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=864, Unknown=6, NotChecked=0, Total=992 [2025-04-14 01:24:50,461 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:24:50,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 105 transitions, 1007 flow. Second operand has 32 states, 32 states have (on average 5.53125) internal successors, (177), 32 states have internal predecessors, (177), 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-04-14 01:24:50,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:24:50,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:24:50,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:24:54,550 WARN L532 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-04-14 01:24:56,179 INFO L116 PetriNetUnfolderBase]: 2360/3443 cut-off events. [2025-04-14 01:24:56,180 INFO L117 PetriNetUnfolderBase]: For 16810/16810 co-relation queries the response was YES. [2025-04-14 01:24:56,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15912 conditions, 3443 events. 2360/3443 cut-off events. For 16810/16810 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 16061 event pairs, 638 based on Foata normal form. 3/3094 useless extension candidates. Maximal degree in co-relation 14694. Up to 1297 conditions per place. [2025-04-14 01:24:56,204 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 248 selfloop transitions, 89 changer transitions 1/338 dead transitions. [2025-04-14 01:24:56,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 338 transitions, 3860 flow [2025-04-14 01:24:56,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 01:24:56,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 01:24:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 170 transitions. [2025-04-14 01:24:56,205 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33203125 [2025-04-14 01:24:56,205 INFO L175 Difference]: Start difference. First operand has 82 places, 105 transitions, 1007 flow. Second operand 16 states and 170 transitions. [2025-04-14 01:24:56,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 338 transitions, 3860 flow [2025-04-14 01:24:56,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 338 transitions, 3660 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-04-14 01:24:56,259 INFO L231 Difference]: Finished difference. Result has 99 places, 186 transitions, 2099 flow [2025-04-14 01:24:56,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2099, PETRI_PLACES=99, PETRI_TRANSITIONS=186} [2025-04-14 01:24:56,259 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 68 predicate places. [2025-04-14 01:24:56,259 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 186 transitions, 2099 flow [2025-04-14 01:24:56,259 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.53125) internal successors, (177), 32 states have internal predecessors, (177), 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-04-14 01:24:56,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:24:56,260 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-04-14 01:24:56,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-14 01:24:56,460 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:24:56,460 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:24:56,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:24:56,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1644378086, now seen corresponding path program 1 times [2025-04-14 01:24:56,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:24:56,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433643988] [2025-04-14 01:24:56,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:24:56,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:24:56,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:24:56,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:24:56,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:24:56,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:24:57,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:24:57,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:24:57,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433643988] [2025-04-14 01:24:57,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433643988] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:24:57,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685920481] [2025-04-14 01:24:57,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:24:57,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:24:57,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:24:57,396 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:24:57,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 01:24:57,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:24:57,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:24:57,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:24:57,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:24:57,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-04-14 01:24:57,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:24:57,493 INFO L354 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-04-14 01:24:57,515 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:24:57,545 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-14 01:24:57,545 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-14 01:24:57,566 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 01:24:57,596 INFO L325 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-04-14 01:24:57,596 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-04-14 01:24:57,638 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 01:24:57,699 INFO L325 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-04-14 01:24:57,700 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2025-04-14 01:24:57,736 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 01:24:57,889 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2025-04-14 01:24:58,066 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 01:24:58,128 INFO L325 Elim1Store]: treesize reduction 164, result has 21.9 percent of original size [2025-04-14 01:24:58,129 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 60 [2025-04-14 01:24:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:24:58,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:25:37,541 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_thread3Thread1of1ForFork2_~i~2_26 Int) (~C1~0.base Int) (v_ArrVal_332 (Array Int Int)) (|v_ULTIMATE.start_main_~k~0#1_96| Int)) (or (< c_~N~0 (+ |v_ULTIMATE.start_main_~k~0#1_96| 1)) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (let ((.cse3 (* v_thread3Thread1of1ForFork2_~i~2_26 4))) (store v_ArrVal_332 (+ .cse3 |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| v_ArrVal_332))) (+ (select (select .cse4 c_~B~0.base) (+ .cse3 c_~B~0.offset)) (select (select .cse4 c_~A~0.base) (+ c_~A~0.offset .cse3))))))))) (let ((.cse1 (store (select .cse0 ~C1~0.base) c_~C1~0.offset (+ (select (select .cse0 c_~B~0.base) c_~B~0.offset) (select (select .cse0 c_~A~0.base) c_~A~0.offset)))) (.cse2 (* 4 |v_ULTIMATE.start_main_~k~0#1_96|))) (= (mod (select (select (store .cse0 ~C1~0.base .cse1) |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (+ |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| .cse2)) 4294967296) (mod (select .cse1 (+ .cse2 c_~C1~0.offset)) 4294967296)))) (< |v_ULTIMATE.start_main_~k~0#1_96| 0) (< c_~N~0 (+ v_thread3Thread1of1ForFork2_~i~2_26 1)) (< v_thread3Thread1of1ForFork2_~i~2_26 0))) is different from false [2025-04-14 01:25:38,903 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:25:38,903 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 652 treesize of output 413 [2025-04-14 01:25:38,909 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 01:25:38,910 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 01:25:38,924 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 01:25:39,249 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:25:39,250 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1343478 treesize of output 1327102 [2025-04-14 01:25:39,511 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:25:39,512 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2334 treesize of output 1968 [2025-04-14 01:25:39,694 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:25:39,695 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3704 treesize of output 3092 [2025-04-14 01:25:39,888 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:25:39,889 INFO L354 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 3776 treesize of output 3508 [2025-04-14 01:25:41,626 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-14 01:25:41,627 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 332 treesize of output 281 [2025-04-14 01:25:44,213 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:25:44,213 INFO L354 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 2849 treesize of output 2765 [2025-04-14 01:26:03,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 3 times theorem prover too weak. 0 trivial. 1 not checked. [2025-04-14 01:26:03,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685920481] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:26:03,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:26:03,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 35 [2025-04-14 01:26:03,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054935037] [2025-04-14 01:26:03,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:26:03,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-14 01:26:03,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:03,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-14 01:26:03,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1106, Unknown=17, NotChecked=68, Total=1332 [2025-04-14 01:26:03,284 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:26:03,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 186 transitions, 2099 flow. Second operand has 37 states, 37 states have (on average 5.1891891891891895) internal successors, (192), 37 states have internal predecessors, (192), 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-04-14 01:26:03,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:03,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:26:03,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:26:07,496 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:15,156 INFO L116 PetriNetUnfolderBase]: 2695/3925 cut-off events. [2025-04-14 01:26:15,157 INFO L117 PetriNetUnfolderBase]: For 26119/26119 co-relation queries the response was YES. [2025-04-14 01:26:15,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20754 conditions, 3925 events. 2695/3925 cut-off events. For 26119/26119 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 18269 event pairs, 644 based on Foata normal form. 2/3923 useless extension candidates. Maximal degree in co-relation 19371. Up to 1297 conditions per place. [2025-04-14 01:26:15,180 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 241 selfloop transitions, 128 changer transitions 2/371 dead transitions. [2025-04-14 01:26:15,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 371 transitions, 4608 flow [2025-04-14 01:26:15,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 01:26:15,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 01:26:15,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 228 transitions. [2025-04-14 01:26:15,182 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.296875 [2025-04-14 01:26:15,182 INFO L175 Difference]: Start difference. First operand has 99 places, 186 transitions, 2099 flow. Second operand 24 states and 228 transitions. [2025-04-14 01:26:15,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 371 transitions, 4608 flow [2025-04-14 01:26:15,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 371 transitions, 4572 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-04-14 01:26:15,273 INFO L231 Difference]: Finished difference. Result has 131 places, 263 transitions, 3480 flow [2025-04-14 01:26:15,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2065, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3480, PETRI_PLACES=131, PETRI_TRANSITIONS=263} [2025-04-14 01:26:15,273 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 100 predicate places. [2025-04-14 01:26:15,274 INFO L485 AbstractCegarLoop]: Abstraction has has 131 places, 263 transitions, 3480 flow [2025-04-14 01:26:15,274 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.1891891891891895) internal successors, (192), 37 states have internal predecessors, (192), 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-04-14 01:26:15,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:15,274 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-04-14 01:26:15,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-14 01:26:15,474 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:26:15,475 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:26:15,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:15,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1711656446, now seen corresponding path program 2 times [2025-04-14 01:26:15,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:15,477 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516922873] [2025-04-14 01:26:15,477 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:26:15,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:15,483 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:26:15,545 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:26:15,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:26:15,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:16,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:26:16,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:16,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516922873] [2025-04-14 01:26:16,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516922873] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:26:16,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722449975] [2025-04-14 01:26:16,505 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:26:16,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:26:16,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:26:16,510 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:26:16,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-14 01:26:16,563 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:26:16,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:26:16,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:26:16,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:16,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-14 01:26:16,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:26:16,606 INFO L354 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-04-14 01:26:16,662 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-14 01:26:16,662 INFO L354 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-04-14 01:26:16,707 INFO L325 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-04-14 01:26:16,707 INFO L354 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-04-14 01:26:17,015 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-14 01:26:17,015 INFO L354 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-04-14 01:26:17,249 INFO L325 Elim1Store]: treesize reduction 134, result has 37.4 percent of original size [2025-04-14 01:26:17,249 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 96 [2025-04-14 01:26:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:26:18,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:26:23,459 INFO L325 Elim1Store]: treesize reduction 118, result has 70.9 percent of original size [2025-04-14 01:26:23,460 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 1982 treesize of output 1213 [2025-04-14 01:26:23,528 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:26:23,529 INFO L354 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 1290 treesize of output 1242 [2025-04-14 01:26:23,703 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-14 01:26:23,703 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 9 [2025-04-14 01:26:23,832 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-14 01:26:23,832 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2025-04-14 01:26:23,939 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-14 01:26:23,939 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2025-04-14 01:26:24,036 INFO L325 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2025-04-14 01:26:24,036 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 25 [2025-04-14 01:26:26,123 INFO L354 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 128 treesize of output 116 [2025-04-14 01:26:26,217 INFO L354 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 296 treesize of output 272 [2025-04-14 01:26:27,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:26:27,036 INFO L354 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 31 treesize of output 25 [2025-04-14 01:26:27,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:26:27,056 INFO L354 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 118 treesize of output 112 [2025-04-14 01:26:30,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:26:30,915 INFO L354 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 118 treesize of output 112 [2025-04-14 01:26:30,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:26:30,962 INFO L354 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 294 treesize of output 288 [2025-04-14 01:26:34,452 INFO L354 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 543 treesize of output 495 [2025-04-14 01:26:40,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:26:40,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:26:40,734 INFO L354 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 318 treesize of output 282 [2025-04-14 01:26:41,015 INFO L354 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 98 treesize of output 80 [2025-04-14 01:26:41,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:26:42,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:26:43,308 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:26:43,309 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 2408 treesize of output 2098 [2025-04-14 01:27:02,299 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-14 01:27:02,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-04-14 01:27:02,300 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-14 01:27:02,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-14 01:27:02,501 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-14 01:27:02,501 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 76 more [2025-04-14 01:27:02,507 INFO L158 Benchmark]: Toolchain (without parser) took 346453.03ms. Allocated memory was 125.8MB in the beginning and 390.1MB in the end (delta: 264.2MB). Free memory was 90.9MB in the beginning and 246.6MB in the end (delta: -155.7MB). Peak memory consumption was 243.0MB. Max. memory is 8.0GB. [2025-04-14 01:27:02,507 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:27:02,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.88ms. Allocated memory is still 125.8MB. Free memory was 90.9MB in the beginning and 75.5MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-14 01:27:02,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.23ms. Allocated memory is still 125.8MB. Free memory was 75.5MB in the beginning and 73.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:27:02,508 INFO L158 Benchmark]: Boogie Preprocessor took 34.01ms. Allocated memory is still 125.8MB. Free memory was 73.4MB in the beginning and 70.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:27:02,508 INFO L158 Benchmark]: IcfgBuilder took 670.97ms. Allocated memory is still 125.8MB. Free memory was 70.9MB in the beginning and 58.3MB in the end (delta: 12.6MB). Peak memory consumption was 57.1MB. Max. memory is 8.0GB. [2025-04-14 01:27:02,508 INFO L158 Benchmark]: TraceAbstraction took 345466.02ms. Allocated memory was 125.8MB in the beginning and 390.1MB in the end (delta: 264.2MB). Free memory was 57.5MB in the beginning and 246.6MB in the end (delta: -189.0MB). Peak memory consumption was 206.9MB. Max. memory is 8.0GB. [2025-04-14 01:27:02,509 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.88ms. Allocated memory is still 125.8MB. Free memory was 90.9MB in the beginning and 75.5MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.23ms. Allocated memory is still 125.8MB. Free memory was 75.5MB in the beginning and 73.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 34.01ms. Allocated memory is still 125.8MB. Free memory was 73.4MB in the beginning and 70.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 670.97ms. Allocated memory is still 125.8MB. Free memory was 70.9MB in the beginning and 58.3MB in the end (delta: 12.6MB). Peak memory consumption was 57.1MB. Max. memory is 8.0GB. * TraceAbstraction took 345466.02ms. Allocated memory was 125.8MB in the beginning and 390.1MB in the end (delta: 264.2MB). Free memory was 57.5MB in the beginning and 246.6MB in the end (delta: -189.0MB). Peak memory consumption was 206.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...