/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/parallel-misc-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:03:21,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:03:21,142 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:03:21,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:03:21,146 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:03:21,167 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:03:21,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:03:21,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:03:21,172 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:03:21,172 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:03:21,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:03:21,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:03:21,172 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:03:21,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:03:21,173 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:03:21,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:03:21,173 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:03:21,173 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:03:21,173 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:03:21,173 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:03:21,173 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:03:21,173 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:03:21,173 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:03:21,173 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:03:21,173 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:03:21,173 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:03:21,173 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:03:21,173 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:03:21,173 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:03:21,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:03:21,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:03:21,173 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:03:21,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:03:21,174 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:03:21,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:03:21,174 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:03:21,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:03:21,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:03:21,174 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:03:21,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:03:21,174 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:03:21,174 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:03:21,174 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:03:21,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:03:21,174 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:03:21,174 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:03:21,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:03:21,174 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:03:21,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:03:21,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:03:21,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:03:21,456 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:03:21,458 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:03:21,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2025-04-13 18:03:22,879 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dce3fdb0/f1f93a9cf4994e1da1e035c5f5195a69/FLAG37e931f25 [2025-04-13 18:03:23,123 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:03:23,124 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2025-04-13 18:03:23,133 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dce3fdb0/f1f93a9cf4994e1da1e035c5f5195a69/FLAG37e931f25 [2025-04-13 18:03:23,928 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dce3fdb0/f1f93a9cf4994e1da1e035c5f5195a69 [2025-04-13 18:03:23,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:03:23,932 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:03:23,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:03:23,933 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:03:23,938 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:03:23,939 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:03:23" (1/1) ... [2025-04-13 18:03:23,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11073424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:23, skipping insertion in model container [2025-04-13 18:03:23,940 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:03:23" (1/1) ... [2025-04-13 18:03:23,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:03:24,106 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/parallel-misc-1.wvr.c[2781,2794] [2025-04-13 18:03:24,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:03:24,124 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:03:24,157 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/parallel-misc-1.wvr.c[2781,2794] [2025-04-13 18:03:24,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:03:24,174 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:03:24,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:24 WrapperNode [2025-04-13 18:03:24,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:03:24,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:03:24,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:03:24,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:03:24,180 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:03:24" (1/1) ... [2025-04-13 18:03:24,188 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:03:24" (1/1) ... [2025-04-13 18:03:24,214 INFO L138 Inliner]: procedures = 22, calls = 31, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 268 [2025-04-13 18:03:24,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:03:24,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:03:24,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:03:24,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:03:24,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:24" (1/1) ... [2025-04-13 18:03:24,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:24" (1/1) ... [2025-04-13 18:03:24,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:24" (1/1) ... [2025-04-13 18:03:24,248 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:03:24,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:24" (1/1) ... [2025-04-13 18:03:24,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:24" (1/1) ... [2025-04-13 18:03:24,254 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:24" (1/1) ... [2025-04-13 18:03:24,255 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:24" (1/1) ... [2025-04-13 18:03:24,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:24" (1/1) ... [2025-04-13 18:03:24,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:24" (1/1) ... [2025-04-13 18:03:24,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:24" (1/1) ... [2025-04-13 18:03:24,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:03:24,265 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:03:24,265 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:03:24,265 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:03:24,269 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:24" (1/1) ... [2025-04-13 18:03:24,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:03:24,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:24,296 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:03:24,301 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:03:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:03:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:03:24,316 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:03:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:03:24,316 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:03:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:03:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 18:03:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 18:03:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 18:03:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 18:03:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:03:24,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:03:24,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 18:03:24,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 18:03:24,318 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:03:24,389 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:03:24,390 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:03:24,749 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:03:24,750 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:03:24,750 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:03:25,213 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:03:25,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:03:25 BoogieIcfgContainer [2025-04-13 18:03:25,214 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:03:25,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:03:25,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:03:25,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:03:25,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:03:23" (1/3) ... [2025-04-13 18:03:25,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60774bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:03:25, skipping insertion in model container [2025-04-13 18:03:25,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:03:24" (2/3) ... [2025-04-13 18:03:25,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60774bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:03:25, skipping insertion in model container [2025-04-13 18:03:25,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:03:25" (3/3) ... [2025-04-13 18:03:25,223 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2025-04-13 18:03:25,236 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:03:25,237 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-1.wvr.c that has 3 procedures, 17 locations, 17 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 18:03:25,237 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:03:25,313 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 18:03:25,337 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 19 transitions, 52 flow [2025-04-13 18:03:25,346 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:03:25,369 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:03:25,379 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;@5d5439bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:03:25,380 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 18:03:25,382 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:03:25,385 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 18:03:25,385 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:25,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:25,385 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:03:25,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:25,390 INFO L85 PathProgramCache]: Analyzing trace with hash 472478342, now seen corresponding path program 1 times [2025-04-13 18:03:25,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:25,396 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710395431] [2025-04-13 18:03:25,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:25,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:25,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 18:03:25,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 18:03:25,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:25,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:25,861 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:03:25,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:25,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710395431] [2025-04-13 18:03:25,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710395431] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:25,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:25,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:03:25,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163170302] [2025-04-13 18:03:25,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:25,866 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:03:25,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:25,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:03:25,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:03:25,887 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 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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:03:26,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:26,017 INFO L93 Difference]: Finished difference Result 72 states and 176 transitions. [2025-04-13 18:03:26,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:03:26,020 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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:03:26,021 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:26,026 INFO L225 Difference]: With dead ends: 72 [2025-04-13 18:03:26,027 INFO L226 Difference]: Without dead ends: 67 [2025-04-13 18:03:26,030 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:03:26,035 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:26,036 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:26,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-04-13 18:03:26,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 52. [2025-04-13 18:03:26,067 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:03:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 116 transitions. [2025-04-13 18:03:26,074 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 116 transitions. Word has length 13 [2025-04-13 18:03:26,074 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:26,074 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 116 transitions. [2025-04-13 18:03:26,074 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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:03:26,074 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 116 transitions. [2025-04-13 18:03:26,075 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:03:26,075 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:26,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:26,076 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:03:26,077 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:03:26,077 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:26,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1802890095, now seen corresponding path program 1 times [2025-04-13 18:03:26,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:26,077 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689308021] [2025-04-13 18:03:26,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:26,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:26,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 18:03:26,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:03:26,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:26,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:26,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:26,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:26,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689308021] [2025-04-13 18:03:26,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689308021] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:26,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:26,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:03:26,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217027993] [2025-04-13 18:03:26,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:26,252 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:03:26,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:26,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:03:26,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:03:26,252 INFO L87 Difference]: Start difference. First operand 52 states and 116 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:03:26,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:26,315 INFO L93 Difference]: Finished difference Result 104 states and 242 transitions. [2025-04-13 18:03:26,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:03:26,315 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:03:26,315 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:26,316 INFO L225 Difference]: With dead ends: 104 [2025-04-13 18:03:26,317 INFO L226 Difference]: Without dead ends: 80 [2025-04-13 18:03:26,317 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:03:26,317 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:26,317 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:03:26,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-04-13 18:03:26,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-04-13 18:03:26,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 2.2658227848101267) internal successors, (179), 79 states have internal predecessors, (179), 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:03:26,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 179 transitions. [2025-04-13 18:03:26,331 INFO L79 Accepts]: Start accepts. Automaton has 80 states and 179 transitions. Word has length 14 [2025-04-13 18:03:26,331 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:26,331 INFO L485 AbstractCegarLoop]: Abstraction has 80 states and 179 transitions. [2025-04-13 18:03:26,331 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:03:26,332 INFO L278 IsEmpty]: Start isEmpty. Operand 80 states and 179 transitions. [2025-04-13 18:03:26,333 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 18:03:26,333 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:26,333 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:26,333 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:03:26,333 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:03:26,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:26,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1283970014, now seen corresponding path program 1 times [2025-04-13 18:03:26,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:26,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704958194] [2025-04-13 18:03:26,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:26,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:26,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 18:03:26,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 18:03:26,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:26,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:26,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:26,474 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704958194] [2025-04-13 18:03:26,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704958194] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:26,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:26,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:03:26,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219101268] [2025-04-13 18:03:26,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:26,474 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:03:26,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:26,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:03:26,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:03:26,475 INFO L87 Difference]: Start difference. First operand 80 states and 179 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:03:26,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:26,522 INFO L93 Difference]: Finished difference Result 91 states and 194 transitions. [2025-04-13 18:03:26,522 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:03:26,523 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:03:26,523 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:26,523 INFO L225 Difference]: With dead ends: 91 [2025-04-13 18:03:26,523 INFO L226 Difference]: Without dead ends: 53 [2025-04-13 18:03:26,524 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:03:26,524 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:26,524 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:03:26,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-04-13 18:03:26,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-04-13 18:03:26,531 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:03:26,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 117 transitions. [2025-04-13 18:03:26,533 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 117 transitions. Word has length 14 [2025-04-13 18:03:26,533 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:26,533 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 117 transitions. [2025-04-13 18:03:26,533 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:03:26,533 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 117 transitions. [2025-04-13 18:03:26,534 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:03:26,535 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:26,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:26,535 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:03:26,535 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:03:26,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:26,535 INFO L85 PathProgramCache]: Analyzing trace with hash -2053668542, now seen corresponding path program 1 times [2025-04-13 18:03:26,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:26,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337824303] [2025-04-13 18:03:26,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:26,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:26,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 18:03:26,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:03:26,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:26,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:26,667 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:03:26,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:26,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337824303] [2025-04-13 18:03:26,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337824303] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:26,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513764481] [2025-04-13 18:03:26,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:26,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:26,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:26,674 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:03:26,681 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:03:26,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 18:03:26,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:03:26,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:26,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:26,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 18:03:26,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:26,826 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:03:26,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:26,862 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:03:26,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513764481] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:26,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:03:26,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2025-04-13 18:03:26,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487641618] [2025-04-13 18:03:26,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:26,863 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:03:26,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:26,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:03:26,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:03:26,863 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), 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:03:26,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:26,916 INFO L93 Difference]: Finished difference Result 65 states and 143 transitions. [2025-04-13 18:03:26,916 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:03:26,916 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) 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:03:26,916 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:26,917 INFO L225 Difference]: With dead ends: 65 [2025-04-13 18:03:26,917 INFO L226 Difference]: Without dead ends: 49 [2025-04-13 18:03:26,918 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:03:26,918 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 48 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:26,918 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:03:26,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-13 18:03:26,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2025-04-13 18:03:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.225) internal successors, (89), 40 states have internal predecessors, (89), 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:03:26,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 89 transitions. [2025-04-13 18:03:26,927 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 89 transitions. Word has length 15 [2025-04-13 18:03:26,927 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:26,927 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 89 transitions. [2025-04-13 18:03:26,927 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) 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:03:26,927 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 89 transitions. [2025-04-13 18:03:26,929 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 18:03:26,929 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:26,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:26,936 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:03:27,129 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:03:27,130 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:03:27,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:27,130 INFO L85 PathProgramCache]: Analyzing trace with hash -845561355, now seen corresponding path program 1 times [2025-04-13 18:03:27,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:27,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080753508] [2025-04-13 18:03:27,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:27,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:27,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 18:03:27,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:03:27,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:27,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:27,250 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:03:27,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:27,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080753508] [2025-04-13 18:03:27,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080753508] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:27,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232513206] [2025-04-13 18:03:27,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:27,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:27,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:27,252 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:03:27,254 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:03:27,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 18:03:27,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 18:03:27,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:27,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:27,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 18:03:27,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:27,380 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:03:27,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:27,414 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:03:27,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232513206] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:27,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:03:27,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2025-04-13 18:03:27,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287978803] [2025-04-13 18:03:27,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:27,415 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:03:27,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:27,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:03:27,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:03:27,415 INFO L87 Difference]: Start difference. First operand 41 states and 89 transitions. Second operand has 5 states, 5 states have (on average 3.0) 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:03:27,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:27,465 INFO L93 Difference]: Finished difference Result 61 states and 135 transitions. [2025-04-13 18:03:27,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:03:27,465 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) 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:03:27,465 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:27,466 INFO L225 Difference]: With dead ends: 61 [2025-04-13 18:03:27,466 INFO L226 Difference]: Without dead ends: 50 [2025-04-13 18:03:27,466 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:03:27,467 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 22 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:27,467 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:03:27,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-04-13 18:03:27,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-04-13 18:03:27,474 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:03:27,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 111 transitions. [2025-04-13 18:03:27,474 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 111 transitions. Word has length 15 [2025-04-13 18:03:27,475 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:27,475 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 111 transitions. [2025-04-13 18:03:27,475 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) 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:03:27,475 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 111 transitions. [2025-04-13 18:03:27,477 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 18:03:27,477 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:27,477 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:03:27,484 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:03:27,677 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:03:27,677 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:03:27,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:27,678 INFO L85 PathProgramCache]: Analyzing trace with hash -401634848, now seen corresponding path program 1 times [2025-04-13 18:03:27,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:27,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945363020] [2025-04-13 18:03:27,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:27,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:27,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 18:03:27,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 18:03:27,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:27,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:28,740 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:03:28,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:28,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945363020] [2025-04-13 18:03:28,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945363020] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:28,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939471046] [2025-04-13 18:03:28,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:03:28,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:28,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:28,744 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:03:28,745 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:03:28,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 18:03:28,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 18:03:28,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:28,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:28,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 18:03:28,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:28,856 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:03:29,051 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 77 treesize of output 49 [2025-04-13 18:03:29,084 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:03:29,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:29,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:29,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939471046] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:03:29,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:03:29,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2025-04-13 18:03:29,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224330785] [2025-04-13 18:03:29,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:03:29,710 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:03:29,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:29,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:03:29,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:03:29,711 INFO L87 Difference]: Start difference. First operand 50 states and 111 transitions. Second operand has 17 states, 16 states have (on average 2.4375) internal successors, (39), 17 states have internal predecessors, (39), 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:03:30,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:30,003 INFO L93 Difference]: Finished difference Result 106 states and 241 transitions. [2025-04-13 18:03:30,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:03:30,004 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.4375) internal successors, (39), 17 states have internal predecessors, (39), 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 16 [2025-04-13 18:03:30,004 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:30,005 INFO L225 Difference]: With dead ends: 106 [2025-04-13 18:03:30,005 INFO L226 Difference]: Without dead ends: 101 [2025-04-13 18:03:30,005 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:03:30,006 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 53 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:30,006 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 49 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:30,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-04-13 18:03:30,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 64. [2025-04-13 18:03:30,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 2.2698412698412698) internal successors, (143), 63 states have internal predecessors, (143), 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:03:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 143 transitions. [2025-04-13 18:03:30,020 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 143 transitions. Word has length 16 [2025-04-13 18:03:30,020 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:30,020 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 143 transitions. [2025-04-13 18:03:30,020 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.4375) internal successors, (39), 17 states have internal predecessors, (39), 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:03:30,020 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 143 transitions. [2025-04-13 18:03:30,021 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 18:03:30,021 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:30,021 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:03:30,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 18:03:30,226 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:03:30,226 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:03:30,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:30,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1109719944, now seen corresponding path program 2 times [2025-04-13 18:03:30,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:30,227 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469110886] [2025-04-13 18:03:30,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:30,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:30,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 18:03:30,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 18:03:30,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:03:30,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:31,054 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:03:31,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:31,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469110886] [2025-04-13 18:03:31,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469110886] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:31,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461160168] [2025-04-13 18:03:31,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:31,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:31,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:31,058 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:03:31,063 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:03:31,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 18:03:31,139 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 18:03:31,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:03:31,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:31,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 18:03:31,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:31,375 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 77 treesize of output 49 [2025-04-13 18:03:31,444 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:03:31,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:31,754 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:03:31,754 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 145 [2025-04-13 18:03:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:31,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461160168] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:03:31,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:03:31,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 17 [2025-04-13 18:03:31,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856890351] [2025-04-13 18:03:31,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:03:31,973 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:03:31,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:31,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:03:31,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:03:31,973 INFO L87 Difference]: Start difference. First operand 64 states and 143 transitions. Second operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 18 states have internal predecessors, (39), 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:03:32,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:32,291 INFO L93 Difference]: Finished difference Result 83 states and 194 transitions. [2025-04-13 18:03:32,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:03:32,292 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 18 states have internal predecessors, (39), 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 16 [2025-04-13 18:03:32,292 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:32,292 INFO L225 Difference]: With dead ends: 83 [2025-04-13 18:03:32,292 INFO L226 Difference]: Without dead ends: 78 [2025-04-13 18:03:32,293 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:03:32,293 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 31 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:32,293 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 39 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:32,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-04-13 18:03:32,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2025-04-13 18:03:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 2.3384615384615386) internal successors, (152), 65 states have internal predecessors, (152), 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:03:32,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 152 transitions. [2025-04-13 18:03:32,304 INFO L79 Accepts]: Start accepts. Automaton has 66 states and 152 transitions. Word has length 16 [2025-04-13 18:03:32,304 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:32,304 INFO L485 AbstractCegarLoop]: Abstraction has 66 states and 152 transitions. [2025-04-13 18:03:32,304 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 18 states have internal predecessors, (39), 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:03:32,304 INFO L278 IsEmpty]: Start isEmpty. Operand 66 states and 152 transitions. [2025-04-13 18:03:32,304 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 18:03:32,305 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:32,305 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:03:32,312 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:03:32,505 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:03:32,505 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:03:32,506 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:32,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1026603054, now seen corresponding path program 3 times [2025-04-13 18:03:32,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:32,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230625992] [2025-04-13 18:03:32,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:32,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:32,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-13 18:03:32,532 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 18:03:32,532 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:03:32,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:33,080 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:03:33,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:33,081 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230625992] [2025-04-13 18:03:33,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230625992] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:33,081 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14138637] [2025-04-13 18:03:33,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:33,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:33,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:33,085 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:03:33,086 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:03:33,126 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-13 18:03:33,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 18:03:33,146 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:03:33,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:33,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 18:03:33,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:33,367 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 77 treesize of output 49 [2025-04-13 18:03:33,432 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:03:33,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:33,733 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:03:33,733 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 201 treesize of output 145 [2025-04-13 18:03:33,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:33,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14138637] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:03:33,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:03:33,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 18 [2025-04-13 18:03:33,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615249494] [2025-04-13 18:03:33,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:03:33,986 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 18:03:33,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:33,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 18:03:33,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:03:33,986 INFO L87 Difference]: Start difference. First operand 66 states and 152 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:34,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:34,354 INFO L93 Difference]: Finished difference Result 96 states and 226 transitions. [2025-04-13 18:03:34,356 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:03:34,356 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 18:03:34,356 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:34,357 INFO L225 Difference]: With dead ends: 96 [2025-04-13 18:03:34,357 INFO L226 Difference]: Without dead ends: 91 [2025-04-13 18:03:34,357 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:03:34,358 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 32 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:34,358 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 33 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:34,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-04-13 18:03:34,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 66. [2025-04-13 18:03:34,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 2.3384615384615386) internal successors, (152), 65 states have internal predecessors, (152), 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:03:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 152 transitions. [2025-04-13 18:03:34,367 INFO L79 Accepts]: Start accepts. Automaton has 66 states and 152 transitions. Word has length 16 [2025-04-13 18:03:34,367 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:34,367 INFO L485 AbstractCegarLoop]: Abstraction has 66 states and 152 transitions. [2025-04-13 18:03:34,367 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:34,367 INFO L278 IsEmpty]: Start isEmpty. Operand 66 states and 152 transitions. [2025-04-13 18:03:34,369 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 18:03:34,369 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:34,369 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:03:34,375 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:03:34,570 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:03:34,570 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:03:34,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:34,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1098933600, now seen corresponding path program 4 times [2025-04-13 18:03:34,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:34,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113625254] [2025-04-13 18:03:34,571 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:03:34,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:34,576 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 18:03:34,611 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 18:03:34,612 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:03:34,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:35,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:35,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:35,471 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113625254] [2025-04-13 18:03:35,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113625254] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:35,471 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715870953] [2025-04-13 18:03:35,471 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:03:35,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:35,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:35,473 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:03:35,474 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:03:35,512 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 18:03:35,530 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 18:03:35,530 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:03:35,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:35,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 18:03:35,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:35,543 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:03:35,637 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 61 treesize of output 41 [2025-04-13 18:03:35,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:35,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:36,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:36,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715870953] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:03:36,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:03:36,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 15 [2025-04-13 18:03:36,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303206885] [2025-04-13 18:03:36,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:03:36,210 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 18:03:36,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:36,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 18:03:36,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:03:36,211 INFO L87 Difference]: Start difference. First operand 66 states and 152 transitions. Second operand has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 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:03:36,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:36,429 INFO L93 Difference]: Finished difference Result 98 states and 232 transitions. [2025-04-13 18:03:36,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:03:36,429 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 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 16 [2025-04-13 18:03:36,430 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:36,430 INFO L225 Difference]: With dead ends: 98 [2025-04-13 18:03:36,430 INFO L226 Difference]: Without dead ends: 93 [2025-04-13 18:03:36,431 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:03:36,431 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 28 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:36,431 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 29 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-04-13 18:03:36,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2025-04-13 18:03:36,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 2.464788732394366) internal successors, (175), 71 states have internal predecessors, (175), 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:03:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 175 transitions. [2025-04-13 18:03:36,459 INFO L79 Accepts]: Start accepts. Automaton has 72 states and 175 transitions. Word has length 16 [2025-04-13 18:03:36,459 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:36,459 INFO L485 AbstractCegarLoop]: Abstraction has 72 states and 175 transitions. [2025-04-13 18:03:36,459 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 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:03:36,459 INFO L278 IsEmpty]: Start isEmpty. Operand 72 states and 175 transitions. [2025-04-13 18:03:36,459 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 18:03:36,460 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:36,460 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:03:36,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 18:03:36,660 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:36,660 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:03:36,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:36,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1182050490, now seen corresponding path program 5 times [2025-04-13 18:03:36,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:36,661 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085696939] [2025-04-13 18:03:36,661 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:36,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:36,672 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 18:03:36,693 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 18:03:36,693 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:03:36,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:36,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:36,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085696939] [2025-04-13 18:03:36,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085696939] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:36,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657523185] [2025-04-13 18:03:36,982 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:36,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:36,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:36,984 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:03:36,985 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:03:37,028 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 18:03:37,046 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 18:03:37,046 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:03:37,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:37,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 18:03:37,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:37,059 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:03:37,149 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 61 treesize of output 41 [2025-04-13 18:03:37,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:37,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:37,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:37,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657523185] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:03:37,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:03:37,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 13 [2025-04-13 18:03:37,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369309541] [2025-04-13 18:03:37,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:03:37,628 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:03:37,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:37,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:03:37,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:03:37,629 INFO L87 Difference]: Start difference. First operand 72 states and 175 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:37,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:37,773 INFO L93 Difference]: Finished difference Result 79 states and 184 transitions. [2025-04-13 18:03:37,773 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:03:37,774 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 18:03:37,774 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:37,774 INFO L225 Difference]: With dead ends: 79 [2025-04-13 18:03:37,774 INFO L226 Difference]: Without dead ends: 74 [2025-04-13 18:03:37,775 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:03:37,775 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 16 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:37,776 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 22 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:37,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-04-13 18:03:37,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2025-04-13 18:03:37,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 2.4057971014492754) internal successors, (166), 69 states have internal predecessors, (166), 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:03:37,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 166 transitions. [2025-04-13 18:03:37,785 INFO L79 Accepts]: Start accepts. Automaton has 70 states and 166 transitions. Word has length 16 [2025-04-13 18:03:37,785 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:37,785 INFO L485 AbstractCegarLoop]: Abstraction has 70 states and 166 transitions. [2025-04-13 18:03:37,786 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:37,786 INFO L278 IsEmpty]: Start isEmpty. Operand 70 states and 166 transitions. [2025-04-13 18:03:37,786 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 18:03:37,786 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:37,786 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:03:37,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 18:03:37,990 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:37,990 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:03:37,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:37,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1395167746, now seen corresponding path program 6 times [2025-04-13 18:03:37,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:37,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709941563] [2025-04-13 18:03:37,991 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:03:37,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:37,997 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-04-13 18:03:38,016 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 18:03:38,017 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:03:38,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:38,434 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:03:38,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:38,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709941563] [2025-04-13 18:03:38,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709941563] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:38,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375656976] [2025-04-13 18:03:38,434 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:03:38,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:38,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:38,436 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:03:38,437 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:03:38,477 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-04-13 18:03:38,493 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 18:03:38,493 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:03:38,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:38,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 18:03:38,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:38,669 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 61 treesize of output 41 [2025-04-13 18:03:38,697 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:03:38,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:38,911 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:03:38,912 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 145 [2025-04-13 18:03:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:39,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375656976] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:03:39,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:03:39,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 18 [2025-04-13 18:03:39,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152300976] [2025-04-13 18:03:39,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:03:39,149 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 18:03:39,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:39,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 18:03:39,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:03:39,151 INFO L87 Difference]: Start difference. First operand 70 states and 166 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:39,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:39,357 INFO L93 Difference]: Finished difference Result 88 states and 206 transitions. [2025-04-13 18:03:39,357 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:03:39,357 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 18:03:39,357 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:39,358 INFO L225 Difference]: With dead ends: 88 [2025-04-13 18:03:39,358 INFO L226 Difference]: Without dead ends: 83 [2025-04-13 18:03:39,359 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:03:39,359 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 17 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:39,359 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 43 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:03:39,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-04-13 18:03:39,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2025-04-13 18:03:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 2.356164383561644) internal successors, (172), 73 states have internal predecessors, (172), 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:03:39,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 172 transitions. [2025-04-13 18:03:39,372 INFO L79 Accepts]: Start accepts. Automaton has 74 states and 172 transitions. Word has length 16 [2025-04-13 18:03:39,373 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:39,373 INFO L485 AbstractCegarLoop]: Abstraction has 74 states and 172 transitions. [2025-04-13 18:03:39,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:39,373 INFO L278 IsEmpty]: Start isEmpty. Operand 74 states and 172 transitions. [2025-04-13 18:03:39,373 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 18:03:39,373 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:39,373 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:39,381 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:03:39,574 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,SelfDestructingSolverStorable10 [2025-04-13 18:03:39,574 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:03:39,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:39,574 INFO L85 PathProgramCache]: Analyzing trace with hash 475184981, now seen corresponding path program 7 times [2025-04-13 18:03:39,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:39,575 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443383677] [2025-04-13 18:03:39,575 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:03:39,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:39,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 18:03:39,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:03:39,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:39,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:39,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:39,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443383677] [2025-04-13 18:03:39,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443383677] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:39,655 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115106405] [2025-04-13 18:03:39,655 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:03:39,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:39,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:39,656 INFO L229 MonitoredProcess]: Starting monitored process 10 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:03:39,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 18:03:39,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 18:03:39,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:03:39,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:39,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:39,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:03:39,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:39,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:39,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:39,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115106405] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:03:39,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:03:39,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 18:03:39,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617411695] [2025-04-13 18:03:39,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:03:39,795 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:03:39,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:39,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:03:39,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:03:39,795 INFO L87 Difference]: Start difference. First operand 74 states and 172 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 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:03:39,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:39,885 INFO L93 Difference]: Finished difference Result 163 states and 376 transitions. [2025-04-13 18:03:39,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:03:39,885 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 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 17 [2025-04-13 18:03:39,885 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:39,886 INFO L225 Difference]: With dead ends: 163 [2025-04-13 18:03:39,886 INFO L226 Difference]: Without dead ends: 132 [2025-04-13 18:03:39,886 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:03:39,887 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:39,887 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 20 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:39,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-04-13 18:03:39,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 119. [2025-04-13 18:03:39,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 2.3389830508474576) internal successors, (276), 118 states have internal predecessors, (276), 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:03:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 276 transitions. [2025-04-13 18:03:39,903 INFO L79 Accepts]: Start accepts. Automaton has 119 states and 276 transitions. Word has length 17 [2025-04-13 18:03:39,903 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:39,904 INFO L485 AbstractCegarLoop]: Abstraction has 119 states and 276 transitions. [2025-04-13 18:03:39,904 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 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:03:39,904 INFO L278 IsEmpty]: Start isEmpty. Operand 119 states and 276 transitions. [2025-04-13 18:03:39,904 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 18:03:39,904 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:39,904 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:39,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 18:03:40,108 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:40,109 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:03:40,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:40,109 INFO L85 PathProgramCache]: Analyzing trace with hash -728197886, now seen corresponding path program 8 times [2025-04-13 18:03:40,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:40,110 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976843365] [2025-04-13 18:03:40,110 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:40,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:40,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 18:03:40,121 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:03:40,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:03:40,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:40,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:40,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:40,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976843365] [2025-04-13 18:03:40,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976843365] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:40,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094790715] [2025-04-13 18:03:40,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:40,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:40,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:40,185 INFO L229 MonitoredProcess]: Starting monitored process 11 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:03:40,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 18:03:40,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 18:03:40,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:03:40,246 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:03:40,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:40,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 18:03:40,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:40,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:40,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094790715] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:03:40,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:03:40,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-04-13 18:03:40,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696530061] [2025-04-13 18:03:40,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:03:40,332 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:03:40,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:40,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:03:40,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:03:40,332 INFO L87 Difference]: Start difference. First operand 119 states and 276 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:40,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:40,624 INFO L93 Difference]: Finished difference Result 180 states and 433 transitions. [2025-04-13 18:03:40,624 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:03:40,624 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 18:03:40,624 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:40,625 INFO L225 Difference]: With dead ends: 180 [2025-04-13 18:03:40,625 INFO L226 Difference]: Without dead ends: 119 [2025-04-13 18:03:40,626 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:03:40,626 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 117 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:40,626 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 28 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:40,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-04-13 18:03:40,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 72. [2025-04-13 18:03:40,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 2.4225352112676055) internal successors, (172), 71 states have internal predecessors, (172), 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:03:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 172 transitions. [2025-04-13 18:03:40,636 INFO L79 Accepts]: Start accepts. Automaton has 72 states and 172 transitions. Word has length 17 [2025-04-13 18:03:40,637 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:40,637 INFO L485 AbstractCegarLoop]: Abstraction has 72 states and 172 transitions. [2025-04-13 18:03:40,637 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:40,637 INFO L278 IsEmpty]: Start isEmpty. Operand 72 states and 172 transitions. [2025-04-13 18:03:40,637 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 18:03:40,637 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:40,637 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:40,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 18:03:40,837 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 18:03:40,838 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:03:40,838 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:40,838 INFO L85 PathProgramCache]: Analyzing trace with hash 111998114, now seen corresponding path program 9 times [2025-04-13 18:03:40,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:40,838 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218833024] [2025-04-13 18:03:40,838 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:40,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:40,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 18:03:40,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 18:03:40,854 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:03:40,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:40,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:03:40,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:40,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218833024] [2025-04-13 18:03:40,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218833024] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:40,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794317540] [2025-04-13 18:03:40,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:40,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:40,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:40,931 INFO L229 MonitoredProcess]: Starting monitored process 12 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:03:40,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 18:03:40,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 18:03:41,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 18:03:41,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:03:41,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:41,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:03:41,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:41,057 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:03:41,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:03:41,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794317540] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:03:41,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:03:41,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 18:03:41,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249040512] [2025-04-13 18:03:41,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:03:41,104 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:03:41,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:41,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:03:41,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:03:41,105 INFO L87 Difference]: Start difference. First operand 72 states and 172 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:41,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:41,189 INFO L93 Difference]: Finished difference Result 105 states and 245 transitions. [2025-04-13 18:03:41,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:03:41,190 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 18:03:41,190 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:41,191 INFO L225 Difference]: With dead ends: 105 [2025-04-13 18:03:41,191 INFO L226 Difference]: Without dead ends: 86 [2025-04-13 18:03:41,191 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:03:41,191 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 72 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 9 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.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:41,191 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 9 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:41,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-04-13 18:03:41,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2025-04-13 18:03:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 2.356164383561644) internal successors, (172), 73 states have internal predecessors, (172), 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:03:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 172 transitions. [2025-04-13 18:03:41,202 INFO L79 Accepts]: Start accepts. Automaton has 74 states and 172 transitions. Word has length 18 [2025-04-13 18:03:41,202 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:41,202 INFO L485 AbstractCegarLoop]: Abstraction has 74 states and 172 transitions. [2025-04-13 18:03:41,202 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:41,202 INFO L278 IsEmpty]: Start isEmpty. Operand 74 states and 172 transitions. [2025-04-13 18:03:41,203 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 18:03:41,203 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:41,203 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:41,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 18:03:41,403 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 18:03:41,403 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:03:41,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:41,404 INFO L85 PathProgramCache]: Analyzing trace with hash 157966823, now seen corresponding path program 10 times [2025-04-13 18:03:41,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:41,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526913819] [2025-04-13 18:03:41,404 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:03:41,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:41,413 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 18:03:41,419 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 18:03:41,420 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:03:41,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:41,490 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:03:41,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:41,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526913819] [2025-04-13 18:03:41,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526913819] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:41,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213028144] [2025-04-13 18:03:41,490 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:03:41,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:41,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:41,493 INFO L229 MonitoredProcess]: Starting monitored process 13 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:03:41,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 18:03:41,545 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 18:03:41,568 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 18:03:41,568 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:03:41,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:41,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:03:41,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:03:41,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:03:41,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213028144] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:03:41,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:03:41,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 18:03:41,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952885313] [2025-04-13 18:03:41,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:03:41,692 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:03:41,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:41,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:03:41,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:03:41,692 INFO L87 Difference]: Start difference. First operand 74 states and 172 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:41,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:41,763 INFO L93 Difference]: Finished difference Result 115 states and 271 transitions. [2025-04-13 18:03:41,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:03:41,763 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 18:03:41,763 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:41,764 INFO L225 Difference]: With dead ends: 115 [2025-04-13 18:03:41,766 INFO L226 Difference]: Without dead ends: 102 [2025-04-13 18:03:41,766 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:03:41,766 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 31 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:41,766 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 12 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:03:41,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-04-13 18:03:41,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 82. [2025-04-13 18:03:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 2.3950617283950617) internal successors, (194), 81 states have internal predecessors, (194), 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:03:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 194 transitions. [2025-04-13 18:03:41,782 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 194 transitions. Word has length 18 [2025-04-13 18:03:41,782 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:41,782 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 194 transitions. [2025-04-13 18:03:41,782 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:41,782 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 194 transitions. [2025-04-13 18:03:41,783 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:03:41,783 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:41,783 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:41,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 18:03:41,984 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 18:03:41,984 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:03:41,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:41,985 INFO L85 PathProgramCache]: Analyzing trace with hash 567774406, now seen corresponding path program 11 times [2025-04-13 18:03:41,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:41,985 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095514176] [2025-04-13 18:03:41,985 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:41,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:41,992 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:03:42,049 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:03:42,049 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:03:42,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:43,734 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:43,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:43,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095514176] [2025-04-13 18:03:43,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095514176] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:43,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477224017] [2025-04-13 18:03:43,734 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:43,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:43,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:43,736 INFO L229 MonitoredProcess]: Starting monitored process 14 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:03:43,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 18:03:43,783 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:03:43,809 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:03:43,809 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:03:43,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:43,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 18:03:43,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:43,843 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:03:44,352 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:03:44,352 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 144 [2025-04-13 18:03:44,429 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:44,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:46,852 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:03:46,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477224017] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:03:46,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:03:46,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 24 [2025-04-13 18:03:46,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817201281] [2025-04-13 18:03:46,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:03:46,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 18:03:46,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:46,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 18:03:46,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:03:46,854 INFO L87 Difference]: Start difference. First operand 82 states and 194 transitions. Second operand has 25 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:47,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:47,390 INFO L93 Difference]: Finished difference Result 120 states and 275 transitions. [2025-04-13 18:03:47,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:03:47,390 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 18:03:47,391 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:47,391 INFO L225 Difference]: With dead ends: 120 [2025-04-13 18:03:47,391 INFO L226 Difference]: Without dead ends: 115 [2025-04-13 18:03:47,392 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:03:47,392 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 49 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:47,392 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 73 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:47,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-04-13 18:03:47,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 98. [2025-04-13 18:03:47,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.402061855670103) internal successors, (233), 97 states have internal predecessors, (233), 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:03:47,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 233 transitions. [2025-04-13 18:03:47,411 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 233 transitions. Word has length 19 [2025-04-13 18:03:47,411 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:47,411 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 233 transitions. [2025-04-13 18:03:47,411 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:47,411 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 233 transitions. [2025-04-13 18:03:47,412 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:03:47,412 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:47,412 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:03:47,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-13 18:03:47,612 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 18:03:47,612 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:03:47,613 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:47,613 INFO L85 PathProgramCache]: Analyzing trace with hash 91972910, now seen corresponding path program 12 times [2025-04-13 18:03:47,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:47,613 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041266530] [2025-04-13 18:03:47,613 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:03:47,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:47,619 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:03:47,652 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:03:47,652 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:03:47,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:48,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:48,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041266530] [2025-04-13 18:03:48,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041266530] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:48,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236817931] [2025-04-13 18:03:48,709 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:03:48,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:48,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:48,712 INFO L229 MonitoredProcess]: Starting monitored process 15 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:03:48,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 18:03:48,760 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-04-13 18:03:48,788 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:03:48,788 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:03:48,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:48,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 18:03:48,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:48,862 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:03:49,403 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:03:49,403 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 233 treesize of output 157 [2025-04-13 18:03:49,673 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:49,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:54,045 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 666 treesize of output 592 [2025-04-13 18:03:54,374 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:03:54,375 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 10 new quantified variables, introduced 45 case distinctions, treesize of input 1147 treesize of output 1207 [2025-04-13 18:04:13,888 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:04:22,475 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:04:23,902 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:04:27,513 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:04:33,922 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:04:35,961 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 18:04:43,528 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:04:50,893 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:04:56,651 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 18:05:04,443 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:05:10,082 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:05:18,127 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 18:05:25,877 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 18:05:51,998 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 18:06:21,543 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:06:33,256 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:06:36,106 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:06:36,600 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 18:06:37,870 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:06:41,837 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 18:06:56,881 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:07:11,499 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:07:14,304 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:07:33,237 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 18:07:46,430 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:07:52,381 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:07:53,667 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 18:08:08,909 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 18:08:50,878 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 18:09:30,211 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:09:44,239 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:09:44,900 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-13 18:09:47,545 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 18:09:51,292 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-13 18:11:45,410 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 18:12:34,591 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 18:13:14,927 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:13:14,927 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:13:14,928 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 18:13:14,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 18:13:15,129 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:13:15,130 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:13:15,134 INFO L158 Benchmark]: Toolchain (without parser) took 591202.70ms. Allocated memory was 155.2MB in the beginning and 864.0MB in the end (delta: 708.8MB). Free memory was 107.6MB in the beginning and 685.7MB in the end (delta: -578.1MB). Peak memory consumption was 533.4MB. Max. memory is 8.0GB. [2025-04-13 18:13:15,135 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 159.4MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:13:15,135 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.83ms. Allocated memory is still 155.2MB. Free memory was 107.6MB in the beginning and 92.3MB in the end (delta: 15.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 18:13:15,135 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.09ms. Allocated memory is still 155.2MB. Free memory was 92.3MB in the beginning and 89.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:13:15,135 INFO L158 Benchmark]: Boogie Preprocessor took 46.31ms. Allocated memory is still 155.2MB. Free memory was 89.7MB in the beginning and 86.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:13:15,135 INFO L158 Benchmark]: RCFGBuilder took 949.31ms. Allocated memory is still 155.2MB. Free memory was 86.6MB in the beginning and 36.1MB in the end (delta: 50.5MB). Peak memory consumption was 70.2MB. Max. memory is 8.0GB. [2025-04-13 18:13:15,135 INFO L158 Benchmark]: TraceAbstraction took 589916.39ms. Allocated memory was 155.2MB in the beginning and 864.0MB in the end (delta: 708.8MB). Free memory was 35.3MB in the beginning and 685.7MB in the end (delta: -650.3MB). Peak memory consumption was 463.2MB. Max. memory is 8.0GB. [2025-04-13 18:13:15,136 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.28ms. Allocated memory is still 159.4MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.83ms. Allocated memory is still 155.2MB. Free memory was 107.6MB in the beginning and 92.3MB in the end (delta: 15.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.09ms. Allocated memory is still 155.2MB. Free memory was 92.3MB in the beginning and 89.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.31ms. Allocated memory is still 155.2MB. Free memory was 89.7MB in the beginning and 86.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 949.31ms. Allocated memory is still 155.2MB. Free memory was 86.6MB in the beginning and 36.1MB in the end (delta: 50.5MB). Peak memory consumption was 70.2MB. Max. memory is 8.0GB. * TraceAbstraction took 589916.39ms. Allocated memory was 155.2MB in the beginning and 864.0MB in the end (delta: 708.8MB). Free memory was 35.3MB in the beginning and 685.7MB in the end (delta: -650.3MB). Peak memory consumption was 463.2MB. 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...