/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/weaver/unroll-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:53:32,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:53:32,963 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-13 18:53:32,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:53:32,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:53:32,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:53:32,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:53:32,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:53:32,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:53:32,991 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:53:32,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:53:32,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:53:32,992 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:53:32,992 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:53:32,992 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:53:32,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:53:32,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:53:32,992 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:53:32,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:53:32,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:53:32,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:53:32,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:53:32,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:53:32,993 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:53:32,993 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:53:32,993 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:53:32,993 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:53:32,993 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:53:32,993 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:53:32,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:53:32,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:53:32,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:53:32,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:53:32,994 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:53:32,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:53:32,994 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:53:32,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:53:32,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:53:32,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:53:32,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:53:32,994 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:53:32,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:53:32,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:53:32,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:53:32,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:53:32,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:53:32,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:53:32,994 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 -> FINITE_AUTOMATA [2025-04-13 18:53:33,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:53:33,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:53:33,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:53:33,224 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:53:33,225 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:53:33,226 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-5.wvr.c [2025-04-13 18:53:34,540 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aabafc033/caa721910b9a48bebe4988077ee2b4b7/FLAGa34e076e3 [2025-04-13 18:53:34,761 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:53:34,762 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c [2025-04-13 18:53:34,769 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aabafc033/caa721910b9a48bebe4988077ee2b4b7/FLAGa34e076e3 [2025-04-13 18:53:35,591 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aabafc033/caa721910b9a48bebe4988077ee2b4b7 [2025-04-13 18:53:35,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:53:35,595 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:53:35,596 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:53:35,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:53:35,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:53:35,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:53:35" (1/1) ... [2025-04-13 18:53:35,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e2dc3e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:53:35, skipping insertion in model container [2025-04-13 18:53:35,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:53:35" (1/1) ... [2025-04-13 18:53:35,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:53:35,795 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/unroll-5.wvr.c[2670,2683] [2025-04-13 18:53:35,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:53:35,818 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:53:35,845 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/unroll-5.wvr.c[2670,2683] [2025-04-13 18:53:35,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:53:35,861 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:53:35,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:53:35 WrapperNode [2025-04-13 18:53:35,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:53:35,863 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:53:35,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:53:35,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:53:35,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:53:35" (1/1) ... [2025-04-13 18:53:35,881 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:53:35" (1/1) ... [2025-04-13 18:53:35,905 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 148 [2025-04-13 18:53:35,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:53:35,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:53:35,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:53:35,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:53:35,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:53:35" (1/1) ... [2025-04-13 18:53:35,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:53:35" (1/1) ... [2025-04-13 18:53:35,916 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:53:35" (1/1) ... [2025-04-13 18:53:35,934 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 18:53:35,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:53:35" (1/1) ... [2025-04-13 18:53:35,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:53:35" (1/1) ... [2025-04-13 18:53:35,940 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:53:35" (1/1) ... [2025-04-13 18:53:35,941 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:53:35" (1/1) ... [2025-04-13 18:53:35,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:53:35" (1/1) ... [2025-04-13 18:53:35,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:53:35" (1/1) ... [2025-04-13 18:53:35,949 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:53:35" (1/1) ... [2025-04-13 18:53:35,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:53:35,953 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:53:35,953 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:53:35,953 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:53:35,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:53:35" (1/1) ... [2025-04-13 18:53:35,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:53:35,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:53:35,979 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-13 18:53:35,981 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-13 18:53:35,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:53:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:53:36,000 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:53:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:53:36,000 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:53:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:53:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 18:53:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 18:53:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 18:53:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 18:53:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:53:36,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:53:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 18:53:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 18:53:36,001 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 18:53:36,079 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:53:36,081 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:53:36,314 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:53:36,315 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:53:36,315 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:53:36,561 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:53:36,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:53:36 BoogieIcfgContainer [2025-04-13 18:53:36,562 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:53:36,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:53:36,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:53:36,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:53:36,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:53:35" (1/3) ... [2025-04-13 18:53:36,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f905bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:53:36, skipping insertion in model container [2025-04-13 18:53:36,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:53:35" (2/3) ... [2025-04-13 18:53:36,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f905bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:53:36, skipping insertion in model container [2025-04-13 18:53:36,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:53:36" (3/3) ... [2025-04-13 18:53:36,568 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-5.wvr.c [2025-04-13 18:53:36,578 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:53:36,579 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-5.wvr.c that has 3 procedures, 17 locations, 17 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 18:53:36,580 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:53:36,620 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 18:53:36,644 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 19 transitions, 52 flow [2025-04-13 18:53:36,654 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 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-13 18:53:36,672 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:53:36,679 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=FINITE_AUTOMATA, 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;@5d16d688, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:53:36,680 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 18:53:36,681 INFO L278 IsEmpty]: Start isEmpty. Operand has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 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-13 18:53:36,685 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 18:53:36,685 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:36,686 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:53:36,686 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:53:36,690 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:36,690 INFO L85 PathProgramCache]: Analyzing trace with hash -391056128, now seen corresponding path program 1 times [2025-04-13 18:53:36,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:36,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322586813] [2025-04-13 18:53:36,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:53:36,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:36,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 18:53:36,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 18:53:36,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:53:36,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:36,953 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-13 18:53:36,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:36,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322586813] [2025-04-13 18:53:36,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322586813] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:36,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:36,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 18:53:36,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488291320] [2025-04-13 18:53:36,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:36,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:53:36,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:36,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:53:36,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:53:36,973 INFO L87 Difference]: Start difference. First operand has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 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) Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-13 18:53:37,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:37,032 INFO L93 Difference]: Finished difference Result 57 states and 125 transitions. [2025-04-13 18:53:37,033 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:53:37,034 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) Word has length 13 [2025-04-13 18:53:37,034 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:37,038 INFO L225 Difference]: With dead ends: 57 [2025-04-13 18:53:37,038 INFO L226 Difference]: Without dead ends: 52 [2025-04-13 18:53:37,041 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:53:37,045 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:37,046 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:53:37,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-13 18:53:37,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-04-13 18:53:37,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.2745098039215685) internal successors, (116), 51 states have internal predecessors, (116), 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-13 18:53:37,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 116 transitions. [2025-04-13 18:53:37,073 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 116 transitions. Word has length 13 [2025-04-13 18:53:37,074 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:37,074 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 116 transitions. [2025-04-13 18:53:37,074 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-13 18:53:37,074 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 116 transitions. [2025-04-13 18:53:37,074 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:53:37,074 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:37,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:53:37,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:53:37,075 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:53:37,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:37,075 INFO L85 PathProgramCache]: Analyzing trace with hash 796868789, now seen corresponding path program 1 times [2025-04-13 18:53:37,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:37,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128294208] [2025-04-13 18:53:37,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:53:37,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:37,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 18:53:37,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:53:37,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:53:37,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:37,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:53:37,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:37,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128294208] [2025-04-13 18:53:37,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128294208] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:37,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:37,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:53:37,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889301711] [2025-04-13 18:53:37,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:37,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:53:37,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:37,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:53:37,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:53:37,219 INFO L87 Difference]: Start difference. First operand 52 states and 116 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 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-13 18:53:37,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:37,260 INFO L93 Difference]: Finished difference Result 103 states and 231 transitions. [2025-04-13 18:53:37,260 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:53:37,261 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 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) Word has length 14 [2025-04-13 18:53:37,261 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:37,261 INFO L225 Difference]: With dead ends: 103 [2025-04-13 18:53:37,261 INFO L226 Difference]: Without dead ends: 53 [2025-04-13 18:53:37,262 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:53:37,262 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:37,262 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:53:37,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-04-13 18:53:37,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-04-13 18:53:37,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 2.25) internal successors, (117), 52 states have internal predecessors, (117), 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-13 18:53:37,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 117 transitions. [2025-04-13 18:53:37,267 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 117 transitions. Word has length 14 [2025-04-13 18:53:37,267 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:37,267 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 117 transitions. [2025-04-13 18:53:37,267 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 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-13 18:53:37,268 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 117 transitions. [2025-04-13 18:53:37,268 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:53:37,268 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:37,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:53:37,268 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:53:37,268 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:53:37,269 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:37,269 INFO L85 PathProgramCache]: Analyzing trace with hash -489611193, now seen corresponding path program 1 times [2025-04-13 18:53:37,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:37,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17258835] [2025-04-13 18:53:37,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:53:37,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:37,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 18:53:37,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:53:37,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:53:37,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:37,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:53:37,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:37,492 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17258835] [2025-04-13 18:53:37,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17258835] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:37,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:37,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:53:37,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78696340] [2025-04-13 18:53:37,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:37,493 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:53:37,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:37,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:53:37,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:53:37,493 INFO L87 Difference]: Start difference. First operand 53 states and 117 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-13 18:53:37,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:37,621 INFO L93 Difference]: Finished difference Result 76 states and 160 transitions. [2025-04-13 18:53:37,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:53:37,621 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) Word has length 15 [2025-04-13 18:53:37,621 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:37,622 INFO L225 Difference]: With dead ends: 76 [2025-04-13 18:53:37,622 INFO L226 Difference]: Without dead ends: 57 [2025-04-13 18:53:37,622 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:53:37,622 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:37,623 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:53:37,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-13 18:53:37,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2025-04-13 18:53:37,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 2.306122448979592) internal successors, (113), 49 states have internal predecessors, (113), 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-13 18:53:37,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 113 transitions. [2025-04-13 18:53:37,628 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 113 transitions. Word has length 15 [2025-04-13 18:53:37,628 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:37,628 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 113 transitions. [2025-04-13 18:53:37,628 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-13 18:53:37,628 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 113 transitions. [2025-04-13 18:53:37,629 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:53:37,629 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:37,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:53:37,629 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:53:37,629 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:53:37,629 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:37,629 INFO L85 PathProgramCache]: Analyzing trace with hash 147041188, now seen corresponding path program 1 times [2025-04-13 18:53:37,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:37,629 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221214273] [2025-04-13 18:53:37,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:53:37,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:37,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 18:53:37,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:53:37,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:53:37,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:37,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:53:37,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:37,768 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221214273] [2025-04-13 18:53:37,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221214273] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:53:37,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552838134] [2025-04-13 18:53:37,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:53:37,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:53:37,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:53:37,772 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-13 18:53:37,773 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-13 18:53:37,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 18:53:37,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:53:37,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:53:37,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:37,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 18:53:37,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:53:37,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:53:37,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:53:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:53:37,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552838134] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:53:37,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:53:37,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-04-13 18:53:37,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202342689] [2025-04-13 18:53:37,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:37,931 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:53:37,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:37,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:53:37,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:53:37,933 INFO L87 Difference]: Start difference. First operand 50 states and 113 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-13 18:53:37,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:37,993 INFO L93 Difference]: Finished difference Result 62 states and 139 transitions. [2025-04-13 18:53:37,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:53:37,993 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) Word has length 15 [2025-04-13 18:53:37,994 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:37,994 INFO L225 Difference]: With dead ends: 62 [2025-04-13 18:53:37,994 INFO L226 Difference]: Without dead ends: 55 [2025-04-13 18:53:37,994 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:53:37,995 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:37,995 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:53:37,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-04-13 18:53:38,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-04-13 18:53:38,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 2.314814814814815) internal successors, (125), 54 states have internal predecessors, (125), 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-13 18:53:38,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 125 transitions. [2025-04-13 18:53:38,007 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 125 transitions. Word has length 15 [2025-04-13 18:53:38,007 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:38,007 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 125 transitions. [2025-04-13 18:53:38,007 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-13 18:53:38,007 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 125 transitions. [2025-04-13 18:53:38,008 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:53:38,008 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:38,008 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:53:38,017 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-13 18:53:38,214 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:53:38,214 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:53:38,214 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:38,214 INFO L85 PathProgramCache]: Analyzing trace with hash 969989766, now seen corresponding path program 2 times [2025-04-13 18:53:38,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:38,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883622566] [2025-04-13 18:53:38,215 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:53:38,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:38,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:53:38,231 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:53:38,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:53:38,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:38,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:53:38,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:38,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883622566] [2025-04-13 18:53:38,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883622566] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:53:38,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872930117] [2025-04-13 18:53:38,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:53:38,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:53:38,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:53:38,449 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-13 18:53:38,450 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-13 18:53:38,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:53:38,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:53:38,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:53:38,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:38,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 18:53:38,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:53:38,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:53:38,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:53:38,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:53:38,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872930117] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:53:38,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:53:38,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2025-04-13 18:53:38,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34356573] [2025-04-13 18:53:38,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:53:38,597 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:53:38,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:38,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:53:38,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:53:38,597 INFO L87 Difference]: Start difference. First operand 55 states and 125 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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-13 18:53:38,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:38,780 INFO L93 Difference]: Finished difference Result 90 states and 191 transitions. [2025-04-13 18:53:38,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:53:38,780 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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) Word has length 15 [2025-04-13 18:53:38,780 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:38,781 INFO L225 Difference]: With dead ends: 90 [2025-04-13 18:53:38,781 INFO L226 Difference]: Without dead ends: 83 [2025-04-13 18:53:38,781 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:53:38,782 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:38,782 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:53:38,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-04-13 18:53:38,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 57. [2025-04-13 18:53:38,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 2.357142857142857) internal successors, (132), 56 states have internal predecessors, (132), 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-13 18:53:38,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 132 transitions. [2025-04-13 18:53:38,790 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 132 transitions. Word has length 15 [2025-04-13 18:53:38,790 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:38,790 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 132 transitions. [2025-04-13 18:53:38,790 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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-13 18:53:38,791 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 132 transitions. [2025-04-13 18:53:38,791 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:53:38,791 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:38,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:53:38,798 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-13 18:53:38,991 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:53:38,992 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:53:38,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:38,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1524111580, now seen corresponding path program 3 times [2025-04-13 18:53:38,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:38,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023612550] [2025-04-13 18:53:38,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:53:38,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:38,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:53:39,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:53:39,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:53:39,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:53:39,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:39,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023612550] [2025-04-13 18:53:39,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023612550] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:53:39,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581335986] [2025-04-13 18:53:39,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:53:39,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:53:39,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:53:39,190 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-13 18:53:39,192 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-13 18:53:39,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:53:39,251 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:53:39,251 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:53:39,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:39,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 18:53:39,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:53:39,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:53:39,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:53:39,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581335986] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:39,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:53:39,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-04-13 18:53:39,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750937811] [2025-04-13 18:53:39,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:39,486 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:53:39,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:39,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:53:39,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:53:39,487 INFO L87 Difference]: Start difference. First operand 57 states and 132 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-13 18:53:39,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:39,957 INFO L93 Difference]: Finished difference Result 73 states and 153 transitions. [2025-04-13 18:53:39,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:53:39,957 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) Word has length 15 [2025-04-13 18:53:39,957 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:39,958 INFO L225 Difference]: With dead ends: 73 [2025-04-13 18:53:39,958 INFO L226 Difference]: Without dead ends: 64 [2025-04-13 18:53:39,958 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:53:39,959 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:39,959 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:53:39,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-04-13 18:53:39,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2025-04-13 18:53:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 2.3214285714285716) internal successors, (130), 56 states have internal predecessors, (130), 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-13 18:53:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 130 transitions. [2025-04-13 18:53:39,966 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 130 transitions. Word has length 15 [2025-04-13 18:53:39,966 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:39,966 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 130 transitions. [2025-04-13 18:53:39,966 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-13 18:53:39,966 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 130 transitions. [2025-04-13 18:53:39,967 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:53:39,967 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:39,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:53:39,973 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-13 18:53:40,171 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-13 18:53:40,171 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:53:40,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:40,171 INFO L85 PathProgramCache]: Analyzing trace with hash -662466487, now seen corresponding path program 2 times [2025-04-13 18:53:40,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:40,172 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800905360] [2025-04-13 18:53:40,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:53:40,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:40,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:53:40,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:53:40,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:53:40,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:40,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:53:40,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:40,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800905360] [2025-04-13 18:53:40,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800905360] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:53:40,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214146280] [2025-04-13 18:53:40,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:53:40,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:53:40,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:53:40,265 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-13 18:53:40,267 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-13 18:53:40,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:53:40,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:53:40,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:53:40,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:40,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 18:53:40,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:53:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:53:40,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:53:40,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:53:40,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214146280] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:53:40,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:53:40,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-04-13 18:53:40,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071320580] [2025-04-13 18:53:40,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:53:40,362 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:53:40,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:40,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:53:40,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:53:40,363 INFO L87 Difference]: Start difference. First operand 57 states and 130 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-13 18:53:40,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:40,436 INFO L93 Difference]: Finished difference Result 76 states and 162 transitions. [2025-04-13 18:53:40,436 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:53:40,436 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) Word has length 15 [2025-04-13 18:53:40,437 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:40,437 INFO L225 Difference]: With dead ends: 76 [2025-04-13 18:53:40,437 INFO L226 Difference]: Without dead ends: 68 [2025-04-13 18:53:40,437 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:53:40,438 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:40,438 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:53:40,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-04-13 18:53:40,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2025-04-13 18:53:40,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 2.3214285714285716) internal successors, (130), 56 states have internal predecessors, (130), 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-13 18:53:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 130 transitions. [2025-04-13 18:53:40,444 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 130 transitions. Word has length 15 [2025-04-13 18:53:40,444 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:40,444 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 130 transitions. [2025-04-13 18:53:40,444 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-13 18:53:40,444 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 130 transitions. [2025-04-13 18:53:40,445 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:53:40,445 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:40,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:53:40,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 18:53:40,645 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-13 18:53:40,645 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:53:40,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:40,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1535389230, now seen corresponding path program 4 times [2025-04-13 18:53:40,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:40,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93988579] [2025-04-13 18:53:40,646 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:53:40,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:40,651 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:53:40,660 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:53:40,660 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:53:40,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:53:40,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:40,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93988579] [2025-04-13 18:53:40,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93988579] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:53:40,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329338751] [2025-04-13 18:53:40,721 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:53:40,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:53:40,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:53:40,723 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-13 18:53:40,725 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-13 18:53:40,760 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:53:40,774 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:53:40,774 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:53:40,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:40,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 18:53:40,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:53:40,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:53:40,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:53:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:53:40,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329338751] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:53:40,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:53:40,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-13 18:53:40,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278232771] [2025-04-13 18:53:40,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:53:40,842 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:53:40,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:40,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:53:40,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:53:40,842 INFO L87 Difference]: Start difference. First operand 57 states and 130 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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-13 18:53:40,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:40,972 INFO L93 Difference]: Finished difference Result 85 states and 187 transitions. [2025-04-13 18:53:40,972 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:53:40,972 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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) Word has length 15 [2025-04-13 18:53:40,972 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:40,973 INFO L225 Difference]: With dead ends: 85 [2025-04-13 18:53:40,973 INFO L226 Difference]: Without dead ends: 78 [2025-04-13 18:53:40,973 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:53:40,973 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:40,973 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:53:40,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-04-13 18:53:40,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 59. [2025-04-13 18:53:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 2.3620689655172415) internal successors, (137), 58 states have internal predecessors, (137), 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-13 18:53:40,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 137 transitions. [2025-04-13 18:53:40,982 INFO L79 Accepts]: Start accepts. Automaton has 59 states and 137 transitions. Word has length 15 [2025-04-13 18:53:40,982 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:40,982 INFO L485 AbstractCegarLoop]: Abstraction has 59 states and 137 transitions. [2025-04-13 18:53:40,982 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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-13 18:53:40,982 INFO L278 IsEmpty]: Start isEmpty. Operand 59 states and 137 transitions. [2025-04-13 18:53:40,983 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:53:40,983 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:40,983 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:53:40,989 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-13 18:53:41,183 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:53:41,184 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:53:41,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:41,184 INFO L85 PathProgramCache]: Analyzing trace with hash -958712116, now seen corresponding path program 5 times [2025-04-13 18:53:41,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:41,184 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145355833] [2025-04-13 18:53:41,184 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:53:41,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:41,189 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:53:41,194 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:53:41,194 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:53:41,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:41,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:53:41,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:41,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145355833] [2025-04-13 18:53:41,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145355833] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:41,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:53:41,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:53:41,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094718747] [2025-04-13 18:53:41,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:41,246 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:53:41,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:41,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:53:41,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:53:41,247 INFO L87 Difference]: Start difference. First operand 59 states and 137 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-13 18:53:41,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:41,344 INFO L93 Difference]: Finished difference Result 82 states and 173 transitions. [2025-04-13 18:53:41,344 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:53:41,344 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) Word has length 15 [2025-04-13 18:53:41,344 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:41,345 INFO L225 Difference]: With dead ends: 82 [2025-04-13 18:53:41,345 INFO L226 Difference]: Without dead ends: 73 [2025-04-13 18:53:41,345 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:53:41,345 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:41,347 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:53:41,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-04-13 18:53:41,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2025-04-13 18:53:41,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 2.3214285714285716) internal successors, (130), 56 states have internal predecessors, (130), 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-13 18:53:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 130 transitions. [2025-04-13 18:53:41,355 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 130 transitions. Word has length 15 [2025-04-13 18:53:41,355 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:41,355 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 130 transitions. [2025-04-13 18:53:41,355 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-13 18:53:41,355 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 130 transitions. [2025-04-13 18:53:41,355 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:53:41,355 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:41,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:53:41,355 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 18:53:41,355 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:53:41,356 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:41,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1832452796, now seen corresponding path program 6 times [2025-04-13 18:53:41,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:41,356 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177521746] [2025-04-13 18:53:41,356 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:53:41,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:41,360 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:53:41,368 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:53:41,368 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:53:41,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:41,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:53:41,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:41,514 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177521746] [2025-04-13 18:53:41,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177521746] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:53:41,514 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906648375] [2025-04-13 18:53:41,514 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:53:41,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:53:41,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:53:41,517 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-13 18:53:41,518 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-13 18:53:41,558 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:53:41,572 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:53:41,572 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:53:41,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:41,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 18:53:41,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:53:42,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:53:42,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:53:42,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906648375] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:53:42,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:53:42,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-04-13 18:53:42,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191303307] [2025-04-13 18:53:42,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:42,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:53:42,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:42,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:53:42,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:53:42,138 INFO L87 Difference]: Start difference. First operand 57 states and 130 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-13 18:53:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:42,207 INFO L93 Difference]: Finished difference Result 66 states and 142 transitions. [2025-04-13 18:53:42,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:53:42,208 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) Word has length 15 [2025-04-13 18:53:42,208 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:42,208 INFO L225 Difference]: With dead ends: 66 [2025-04-13 18:53:42,208 INFO L226 Difference]: Without dead ends: 55 [2025-04-13 18:53:42,209 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:53:42,209 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:42,209 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:53:42,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-04-13 18:53:42,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-04-13 18:53:42,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 2.314814814814815) internal successors, (125), 54 states have internal predecessors, (125), 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-13 18:53:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 125 transitions. [2025-04-13 18:53:42,220 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 125 transitions. Word has length 15 [2025-04-13 18:53:42,220 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:42,220 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 125 transitions. [2025-04-13 18:53:42,220 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-13 18:53:42,220 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 125 transitions. [2025-04-13 18:53:42,221 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:53:42,221 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:42,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:53:42,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 18:53:42,421 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-13 18:53:42,422 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:53:42,422 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:42,422 INFO L85 PathProgramCache]: Analyzing trace with hash -115501049, now seen corresponding path program 3 times [2025-04-13 18:53:42,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:42,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836938569] [2025-04-13 18:53:42,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:53:42,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:42,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:53:42,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:53:42,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:53:42,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:53:42,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:42,488 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836938569] [2025-04-13 18:53:42,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836938569] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:53:42,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932322060] [2025-04-13 18:53:42,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:53:42,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:53:42,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:53:42,491 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-13 18:53:42,492 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-13 18:53:42,528 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-13 18:53:42,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:53:42,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:53:42,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:42,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 18:53:42,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:53:42,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:53:42,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:53:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:53:42,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932322060] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:53:42,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:53:42,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2025-04-13 18:53:42,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719595688] [2025-04-13 18:53:42,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:53:42,593 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:53:42,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:42,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:53:42,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:53:42,594 INFO L87 Difference]: Start difference. First operand 55 states and 125 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-13 18:53:42,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:53:42,650 INFO L93 Difference]: Finished difference Result 66 states and 144 transitions. [2025-04-13 18:53:42,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:53:42,651 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) Word has length 15 [2025-04-13 18:53:42,651 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:53:42,667 INFO L225 Difference]: With dead ends: 66 [2025-04-13 18:53:42,667 INFO L226 Difference]: Without dead ends: 58 [2025-04-13 18:53:42,667 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:53:42,667 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:53:42,668 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:53:42,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-04-13 18:53:42,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2025-04-13 18:53:42,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 2.2653061224489797) internal successors, (111), 49 states have internal predecessors, (111), 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-13 18:53:42,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 111 transitions. [2025-04-13 18:53:42,674 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 111 transitions. Word has length 15 [2025-04-13 18:53:42,675 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:42,675 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 111 transitions. [2025-04-13 18:53:42,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-13 18:53:42,675 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 111 transitions. [2025-04-13 18:53:42,675 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 18:53:42,675 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:42,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:53:42,681 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-13 18:53:42,879 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-13 18:53:42,879 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:53:42,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:42,879 INFO L85 PathProgramCache]: Analyzing trace with hash 298016401, now seen corresponding path program 1 times [2025-04-13 18:53:42,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:42,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220445563] [2025-04-13 18:53:42,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:53:42,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:42,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 18:53:42,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 18:53:42,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:53:42,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:53:42,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:42,988 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220445563] [2025-04-13 18:53:42,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220445563] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:53:42,988 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881337294] [2025-04-13 18:53:42,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:53:42,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:53:42,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:53:42,990 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-13 18:53:42,992 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-13 18:53:43,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 18:53:43,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 18:53:43,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:53:43,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:43,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:53:43,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:53:43,077 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-13 18:53:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:53:43,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:53:43,625 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 426 treesize of output 374 [2025-04-13 18:53:44,061 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:53:44,062 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 17 new quantified variables, introduced 45 case distinctions, treesize of input 3114 treesize of output 1874 [2025-04-13 18:54:43,211 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:54:46,743 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:54:50,062 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 18:55:13,133 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 18:55:33,649 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:55:34,296 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:55:41,726 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 18:55:42,289 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 18:56:24,913 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:56:25,224 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 18:56:51,450 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 18:57:39,857 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 18:57:41,717 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-13 18:58:42,261 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-13 18:58:42,261 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-13 18:58:42,262 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 18:58:42,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 18:58:42,462 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-13 18:58:42,463 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:135) 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$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.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) ... 69 more [2025-04-13 18:58:42,467 INFO L158 Benchmark]: Toolchain (without parser) took 306872.33ms. Allocated memory was 142.6MB in the beginning and 893.4MB in the end (delta: 750.8MB). Free memory was 98.7MB in the beginning and 622.2MB in the end (delta: -523.4MB). Peak memory consumption was 547.8MB. Max. memory is 8.0GB. [2025-04-13 18:58:42,467 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:58:42,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.07ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 83.7MB in the end (delta: 15.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 18:58:42,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.75ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 81.6MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:58:42,467 INFO L158 Benchmark]: Boogie Preprocessor took 46.60ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 79.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:58:42,468 INFO L158 Benchmark]: RCFGBuilder took 609.05ms. Allocated memory is still 142.6MB. Free memory was 79.6MB in the beginning and 96.6MB in the end (delta: -17.0MB). Peak memory consumption was 61.2MB. Max. memory is 8.0GB. [2025-04-13 18:58:42,468 INFO L158 Benchmark]: TraceAbstraction took 305903.41ms. Allocated memory was 142.6MB in the beginning and 893.4MB in the end (delta: 750.8MB). Free memory was 95.9MB in the beginning and 622.2MB in the end (delta: -526.3MB). Peak memory consumption was 545.4MB. Max. memory is 8.0GB. [2025-04-13 18:58:42,471 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.16ms. Allocated memory is still 159.4MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 267.07ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 83.7MB in the end (delta: 15.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.75ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 81.6MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.60ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 79.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 609.05ms. Allocated memory is still 142.6MB. Free memory was 79.6MB in the beginning and 96.6MB in the end (delta: -17.0MB). Peak memory consumption was 61.2MB. Max. memory is 8.0GB. * TraceAbstraction took 305903.41ms. Allocated memory was 142.6MB in the beginning and 893.4MB in the end (delta: 750.8MB). Free memory was 95.9MB in the beginning and 622.2MB in the end (delta: -526.3MB). Peak memory consumption was 545.4MB. 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...