/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:06:34,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:06:34,563 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 22:06:34,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:06:34,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:06:34,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:06:34,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:06:34,587 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:06:34,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:06:34,587 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:06:34,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:06:34,588 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:06:34,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:06:34,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:06:34,589 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:06:34,589 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:06:34,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:06:34,589 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:06:34,589 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:06:34,589 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:06:34,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:06:34,589 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:06:34,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:06:34,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:06:34,589 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:06:34,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:06:34,589 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:06:34,589 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:06:34,590 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:06:34,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:06:34,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:06:34,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:06:34,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:06:34,590 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:06:34,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:06:34,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:06:34,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:06:34,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:06:34,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:06:34,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:06:34,590 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:06:34,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:06:34,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:06:34,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:06:34,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:06:34,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:06:34,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:06:34,591 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 22:06:34,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:06:34,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:06:34,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:06:34,838 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:06:34,839 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:06:34,840 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c [2025-04-13 22:06:36,195 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab902d713/9658b897a12a4056964809d048317aa9/FLAG7f84f4dd5 [2025-04-13 22:06:36,396 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:06:36,396 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c [2025-04-13 22:06:36,402 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab902d713/9658b897a12a4056964809d048317aa9/FLAG7f84f4dd5 [2025-04-13 22:06:37,245 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab902d713/9658b897a12a4056964809d048317aa9 [2025-04-13 22:06:37,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:06:37,248 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:06:37,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:06:37,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:06:37,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:06:37,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:06:37" (1/1) ... [2025-04-13 22:06:37,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c0e6d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:06:37, skipping insertion in model container [2025-04-13 22:06:37,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:06:37" (1/1) ... [2025-04-13 22:06:37,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:06:37,429 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/bench-exp3x3.wvr.c[2703,2716] [2025-04-13 22:06:37,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:06:37,441 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:06:37,462 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/bench-exp3x3.wvr.c[2703,2716] [2025-04-13 22:06:37,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:06:37,475 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:06:37,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:06:37 WrapperNode [2025-04-13 22:06:37,476 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:06:37,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:06:37,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:06:37,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:06:37,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:06:37" (1/1) ... [2025-04-13 22:06:37,487 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:06:37" (1/1) ... [2025-04-13 22:06:37,502 INFO L138 Inliner]: procedures = 21, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2025-04-13 22:06:37,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:06:37,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:06:37,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:06:37,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:06:37,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:06:37" (1/1) ... [2025-04-13 22:06:37,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:06:37" (1/1) ... [2025-04-13 22:06:37,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:06:37" (1/1) ... [2025-04-13 22:06:37,530 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 22:06:37,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:06:37" (1/1) ... [2025-04-13 22:06:37,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:06:37" (1/1) ... [2025-04-13 22:06:37,534 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:06:37" (1/1) ... [2025-04-13 22:06:37,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:06:37" (1/1) ... [2025-04-13 22:06:37,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:06:37" (1/1) ... [2025-04-13 22:06:37,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:06:37" (1/1) ... [2025-04-13 22:06:37,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:06:37,540 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:06:37,540 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:06:37,540 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:06:37,541 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:06:37" (1/1) ... [2025-04-13 22:06:37,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:06:37,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:06:37,569 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 22:06:37,572 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 22:06:37,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:06:37,591 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:06:37,591 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:06:37,591 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:06:37,591 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:06:37,591 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:06:37,591 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:06:37,591 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 22:06:37,591 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 22:06:37,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:06:37,591 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-13 22:06:37,591 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-13 22:06:37,591 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-13 22:06:37,592 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-13 22:06:37,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:06:37,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:06:37,593 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 22:06:37,666 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:06:37,668 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:06:37,884 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:06:37,885 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:06:37,885 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:06:38,052 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:06:38,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:06:38 BoogieIcfgContainer [2025-04-13 22:06:38,052 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:06:38,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:06:38,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:06:38,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:06:38,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:06:37" (1/3) ... [2025-04-13 22:06:38,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e24d72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:06:38, skipping insertion in model container [2025-04-13 22:06:38,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:06:37" (2/3) ... [2025-04-13 22:06:38,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e24d72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:06:38, skipping insertion in model container [2025-04-13 22:06:38,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:06:38" (3/3) ... [2025-04-13 22:06:38,058 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp3x3.wvr.c [2025-04-13 22:06:38,068 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:06:38,069 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp3x3.wvr.c that has 7 procedures, 40 locations, 39 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 22:06:38,069 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:06:38,123 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-13 22:06:38,149 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 45 transitions, 132 flow [2025-04-13 22:06:38,329 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2551 states, 2550 states have (on average 6.075686274509804) internal successors, (15493), 2550 states have internal predecessors, (15493), 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 22:06:38,350 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:06:38,361 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;@2fd4469f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:06:38,361 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 22:06:38,374 INFO L278 IsEmpty]: Start isEmpty. Operand has 2551 states, 2550 states have (on average 6.075686274509804) internal successors, (15493), 2550 states have internal predecessors, (15493), 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 22:06:38,407 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 22:06:38,407 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:06:38,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:06:38,408 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 22:06:38,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:06:38,412 INFO L85 PathProgramCache]: Analyzing trace with hash -373746784, now seen corresponding path program 1 times [2025-04-13 22:06:38,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:06:38,419 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482107862] [2025-04-13 22:06:38,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:06:38,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:06:38,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 22:06:38,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 22:06:38,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:06:38,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:06:38,934 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 22:06:38,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:06:38,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482107862] [2025-04-13 22:06:38,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482107862] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:06:38,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:06:38,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 22:06:38,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152512368] [2025-04-13 22:06:38,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:06:38,940 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:06:38,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:06:38,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:06:38,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:06:38,963 INFO L87 Difference]: Start difference. First operand has 2551 states, 2550 states have (on average 6.075686274509804) internal successors, (15493), 2550 states have internal predecessors, (15493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 2 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 22:06:39,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:06:39,616 INFO L93 Difference]: Finished difference Result 5088 states and 30931 transitions. [2025-04-13 22:06:39,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:06:39,617 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 2 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 32 [2025-04-13 22:06:39,618 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:06:39,720 INFO L225 Difference]: With dead ends: 5088 [2025-04-13 22:06:39,720 INFO L226 Difference]: Without dead ends: 5079 [2025-04-13 22:06:39,726 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:06:39,727 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:06:39,728 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:06:39,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5079 states. [2025-04-13 22:06:40,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5079 to 5079. [2025-04-13 22:06:40,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5079 states, 5078 states have (on average 6.084285151634502) internal successors, (30896), 5078 states have internal predecessors, (30896), 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 22:06:40,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5079 states to 5079 states and 30896 transitions. [2025-04-13 22:06:40,212 INFO L79 Accepts]: Start accepts. Automaton has 5079 states and 30896 transitions. Word has length 32 [2025-04-13 22:06:40,213 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:06:40,213 INFO L485 AbstractCegarLoop]: Abstraction has 5079 states and 30896 transitions. [2025-04-13 22:06:40,214 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 2 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 22:06:40,214 INFO L278 IsEmpty]: Start isEmpty. Operand 5079 states and 30896 transitions. [2025-04-13 22:06:40,233 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:06:40,234 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:06:40,234 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:06:40,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:06:40,234 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 22:06:40,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:06:40,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1853111525, now seen corresponding path program 1 times [2025-04-13 22:06:40,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:06:40,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275089446] [2025-04-13 22:06:40,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:06:40,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:06:40,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:06:40,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:06:40,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:06:40,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:06:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:06:40,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:06:40,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275089446] [2025-04-13 22:06:40,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275089446] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:06:40,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792999308] [2025-04-13 22:06:40,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:06:40,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:06:40,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:06:40,353 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 22:06:40,355 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 22:06:40,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:06:40,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:06:40,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:06:40,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:06:40,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 22:06:40,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:06:40,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:06:40,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:06:40,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:06:40,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792999308] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:06:40,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:06:40,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 22:06:40,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23882283] [2025-04-13 22:06:40,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:06:40,775 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:06:40,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:06:40,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:06:40,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:06:40,775 INFO L87 Difference]: Start difference. First operand 5079 states and 30896 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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 22:06:41,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:06:41,827 INFO L93 Difference]: Finished difference Result 9316 states and 56001 transitions. [2025-04-13 22:06:41,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:06:41,827 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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 33 [2025-04-13 22:06:41,827 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:06:41,903 INFO L225 Difference]: With dead ends: 9316 [2025-04-13 22:06:41,903 INFO L226 Difference]: Without dead ends: 8548 [2025-04-13 22:06:41,909 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:06:41,909 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 114 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:06:41,910 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 37 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:06:41,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8548 states. [2025-04-13 22:06:42,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8548 to 6487. [2025-04-13 22:06:42,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6487 states, 6486 states have (on average 6.224483502929386) internal successors, (40372), 6486 states have internal predecessors, (40372), 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 22:06:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6487 states to 6487 states and 40372 transitions. [2025-04-13 22:06:42,500 INFO L79 Accepts]: Start accepts. Automaton has 6487 states and 40372 transitions. Word has length 33 [2025-04-13 22:06:42,501 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:06:42,501 INFO L485 AbstractCegarLoop]: Abstraction has 6487 states and 40372 transitions. [2025-04-13 22:06:42,501 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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 22:06:42,501 INFO L278 IsEmpty]: Start isEmpty. Operand 6487 states and 40372 transitions. [2025-04-13 22:06:42,527 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:06:42,528 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:06:42,528 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:06:42,537 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 22:06:42,733 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:06:42,734 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 22:06:42,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:06:42,734 INFO L85 PathProgramCache]: Analyzing trace with hash -997818218, now seen corresponding path program 1 times [2025-04-13 22:06:42,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:06:42,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972807451] [2025-04-13 22:06:42,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:06:42,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:06:42,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:06:42,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:06:42,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:06:42,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:06:42,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:06:42,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:06:42,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972807451] [2025-04-13 22:06:42,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972807451] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:06:42,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761456374] [2025-04-13 22:06:42,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:06:42,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:06:42,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:06:42,820 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 22:06:42,822 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 22:06:42,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:06:42,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:06:42,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:06:42,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:06:42,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 22:06:42,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:06:43,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:06:43,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:06:43,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:06:43,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761456374] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:06:43,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:06:43,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 22:06:43,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309067841] [2025-04-13 22:06:43,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:06:43,047 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:06:43,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:06:43,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:06:43,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:06:43,048 INFO L87 Difference]: Start difference. First operand 6487 states and 40372 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 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 22:06:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:06:44,089 INFO L93 Difference]: Finished difference Result 12347 states and 76668 transitions. [2025-04-13 22:06:44,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:06:44,089 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 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 33 [2025-04-13 22:06:44,089 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:06:44,160 INFO L225 Difference]: With dead ends: 12347 [2025-04-13 22:06:44,160 INFO L226 Difference]: Without dead ends: 11472 [2025-04-13 22:06:44,167 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:06:44,168 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 73 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:06:44,168 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 45 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:06:44,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11472 states. [2025-04-13 22:06:44,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11472 to 8971. [2025-04-13 22:06:44,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8971 states, 8970 states have (on average 6.397101449275362) internal successors, (57382), 8970 states have internal predecessors, (57382), 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 22:06:44,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8971 states to 8971 states and 57382 transitions. [2025-04-13 22:06:44,956 INFO L79 Accepts]: Start accepts. Automaton has 8971 states and 57382 transitions. Word has length 33 [2025-04-13 22:06:44,956 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:06:44,956 INFO L485 AbstractCegarLoop]: Abstraction has 8971 states and 57382 transitions. [2025-04-13 22:06:44,956 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 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 22:06:44,956 INFO L278 IsEmpty]: Start isEmpty. Operand 8971 states and 57382 transitions. [2025-04-13 22:06:44,990 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:06:44,990 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:06:44,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:06:44,996 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 22:06:45,191 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-13 22:06:45,191 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 22:06:45,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:06:45,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1604320982, now seen corresponding path program 1 times [2025-04-13 22:06:45,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:06:45,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733288649] [2025-04-13 22:06:45,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:06:45,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:06:45,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:06:45,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:06:45,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:06:45,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:06:45,275 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 22:06:45,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:06:45,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733288649] [2025-04-13 22:06:45,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733288649] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:06:45,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:06:45,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:06:45,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057937965] [2025-04-13 22:06:45,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:06:45,275 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:06:45,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:06:45,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:06:45,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:06:45,276 INFO L87 Difference]: Start difference. First operand 8971 states and 57382 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 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 22:06:46,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:06:46,467 INFO L93 Difference]: Finished difference Result 12142 states and 74930 transitions. [2025-04-13 22:06:46,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:06:46,467 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 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 33 [2025-04-13 22:06:46,467 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:06:46,538 INFO L225 Difference]: With dead ends: 12142 [2025-04-13 22:06:46,539 INFO L226 Difference]: Without dead ends: 11005 [2025-04-13 22:06:46,547 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:06:46,548 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 96 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:06:46,548 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 29 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:06:46,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11005 states. [2025-04-13 22:06:47,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11005 to 9327. [2025-04-13 22:06:47,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9327 states, 9326 states have (on average 6.335406390735578) internal successors, (59084), 9326 states have internal predecessors, (59084), 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 22:06:47,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9327 states to 9327 states and 59084 transitions. [2025-04-13 22:06:47,320 INFO L79 Accepts]: Start accepts. Automaton has 9327 states and 59084 transitions. Word has length 33 [2025-04-13 22:06:47,321 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:06:47,321 INFO L485 AbstractCegarLoop]: Abstraction has 9327 states and 59084 transitions. [2025-04-13 22:06:47,321 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 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 22:06:47,321 INFO L278 IsEmpty]: Start isEmpty. Operand 9327 states and 59084 transitions. [2025-04-13 22:06:47,348 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:06:47,348 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:06:47,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:06:47,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:06:47,348 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 22:06:47,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:06:47,349 INFO L85 PathProgramCache]: Analyzing trace with hash -2039763401, now seen corresponding path program 1 times [2025-04-13 22:06:47,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:06:47,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595542739] [2025-04-13 22:06:47,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:06:47,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:06:47,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:06:47,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:06:47,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:06:47,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:06:47,426 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 22:06:47,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:06:47,426 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595542739] [2025-04-13 22:06:47,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595542739] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:06:47,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:06:47,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:06:47,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342282609] [2025-04-13 22:06:47,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:06:47,426 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:06:47,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:06:47,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:06:47,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:06:47,427 INFO L87 Difference]: Start difference. First operand 9327 states and 59084 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 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 22:06:48,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:06:48,555 INFO L93 Difference]: Finished difference Result 11977 states and 73498 transitions. [2025-04-13 22:06:48,555 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:06:48,556 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 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 33 [2025-04-13 22:06:48,556 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:06:48,622 INFO L225 Difference]: With dead ends: 11977 [2025-04-13 22:06:48,622 INFO L226 Difference]: Without dead ends: 11023 [2025-04-13 22:06:48,629 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:06:48,629 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 79 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:06:48,629 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 29 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:06:48,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11023 states. [2025-04-13 22:06:49,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11023 to 9752. [2025-04-13 22:06:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9752 states, 9751 states have (on average 6.257101835709158) internal successors, (61013), 9751 states have internal predecessors, (61013), 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 22:06:49,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9752 states to 9752 states and 61013 transitions. [2025-04-13 22:06:49,838 INFO L79 Accepts]: Start accepts. Automaton has 9752 states and 61013 transitions. Word has length 33 [2025-04-13 22:06:49,839 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:06:49,839 INFO L485 AbstractCegarLoop]: Abstraction has 9752 states and 61013 transitions. [2025-04-13 22:06:49,839 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 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 22:06:49,839 INFO L278 IsEmpty]: Start isEmpty. Operand 9752 states and 61013 transitions. [2025-04-13 22:06:49,863 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:06:49,863 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:06:49,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:06:49,864 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:06:49,864 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 22:06:49,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:06:49,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1482883992, now seen corresponding path program 1 times [2025-04-13 22:06:49,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:06:49,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446347121] [2025-04-13 22:06:49,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:06:49,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:06:49,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:06:49,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:06:49,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:06:49,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:06:49,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:06:49,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:06:49,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446347121] [2025-04-13 22:06:49,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446347121] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:06:49,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539377944] [2025-04-13 22:06:49,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:06:49,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:06:49,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:06:49,996 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 22:06:49,998 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 22:06:50,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:06:50,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:06:50,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:06:50,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:06:50,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 22:06:50,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:06:50,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:06:50,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:06:50,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:06:50,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539377944] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:06:50,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:06:50,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 22:06:50,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172902986] [2025-04-13 22:06:50,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:06:50,236 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:06:50,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:06:50,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:06:50,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:06:50,237 INFO L87 Difference]: Start difference. First operand 9752 states and 61013 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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 22:06:51,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:06:51,849 INFO L93 Difference]: Finished difference Result 18230 states and 115202 transitions. [2025-04-13 22:06:51,850 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:06:51,850 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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 33 [2025-04-13 22:06:51,850 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:06:51,949 INFO L225 Difference]: With dead ends: 18230 [2025-04-13 22:06:51,950 INFO L226 Difference]: Without dead ends: 17061 [2025-04-13 22:06:51,962 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:06:51,963 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 74 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:06:51,963 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 39 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:06:51,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17061 states. [2025-04-13 22:06:53,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17061 to 13768. [2025-04-13 22:06:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13768 states, 13767 states have (on average 6.4560180140916685) internal successors, (88880), 13767 states have internal predecessors, (88880), 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 22:06:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13768 states to 13768 states and 88880 transitions. [2025-04-13 22:06:53,492 INFO L79 Accepts]: Start accepts. Automaton has 13768 states and 88880 transitions. Word has length 33 [2025-04-13 22:06:53,492 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:06:53,492 INFO L485 AbstractCegarLoop]: Abstraction has 13768 states and 88880 transitions. [2025-04-13 22:06:53,492 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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 22:06:53,493 INFO L278 IsEmpty]: Start isEmpty. Operand 13768 states and 88880 transitions. [2025-04-13 22:06:53,528 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:06:53,529 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:06:53,529 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:06:53,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 22:06:53,729 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 22:06:53,729 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 22:06:53,730 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:06:53,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1677833545, now seen corresponding path program 1 times [2025-04-13 22:06:53,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:06:53,730 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589195044] [2025-04-13 22:06:53,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:06:53,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:06:53,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:06:53,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:06:53,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:06:53,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:06:53,803 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 22:06:53,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:06:53,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589195044] [2025-04-13 22:06:53,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589195044] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:06:53,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:06:53,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:06:53,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174288171] [2025-04-13 22:06:53,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:06:53,804 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:06:53,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:06:53,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:06:53,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:06:53,804 INFO L87 Difference]: Start difference. First operand 13768 states and 88880 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 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 22:06:55,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:06:55,901 INFO L93 Difference]: Finished difference Result 17062 states and 107483 transitions. [2025-04-13 22:06:55,902 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:06:55,902 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 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 33 [2025-04-13 22:06:55,902 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:06:55,980 INFO L225 Difference]: With dead ends: 17062 [2025-04-13 22:06:55,980 INFO L226 Difference]: Without dead ends: 15816 [2025-04-13 22:06:55,986 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:06:55,987 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:06:55,987 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 29 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:06:56,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15816 states. [2025-04-13 22:06:57,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15816 to 14280. [2025-04-13 22:06:57,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14280 states, 14279 states have (on average 6.396806499054556) internal successors, (91340), 14279 states have internal predecessors, (91340), 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 22:06:57,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14280 states to 14280 states and 91340 transitions. [2025-04-13 22:06:57,542 INFO L79 Accepts]: Start accepts. Automaton has 14280 states and 91340 transitions. Word has length 33 [2025-04-13 22:06:57,542 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:06:57,542 INFO L485 AbstractCegarLoop]: Abstraction has 14280 states and 91340 transitions. [2025-04-13 22:06:57,542 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 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 22:06:57,542 INFO L278 IsEmpty]: Start isEmpty. Operand 14280 states and 91340 transitions. [2025-04-13 22:06:57,578 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:06:57,578 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:06:57,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:06:57,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:06:57,578 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 22:06:57,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:06:57,579 INFO L85 PathProgramCache]: Analyzing trace with hash -327140471, now seen corresponding path program 2 times [2025-04-13 22:06:57,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:06:57,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876668315] [2025-04-13 22:06:57,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:06:57,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:06:57,584 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:06:57,597 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:06:57,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:06:57,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:06:57,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:06:57,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:06:57,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876668315] [2025-04-13 22:06:57,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876668315] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:06:57,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507539182] [2025-04-13 22:06:57,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:06:57,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:06:57,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:06:57,654 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 22:06:57,655 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 22:06:57,693 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:06:57,713 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:06:57,713 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:06:57,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:06:57,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 22:06:57,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:06:57,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:06:57,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:06:57,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:06:57,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507539182] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:06:57,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:06:57,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 22:06:57,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489936230] [2025-04-13 22:06:57,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:06:57,890 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:06:57,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:06:57,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:06:57,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:06:57,890 INFO L87 Difference]: Start difference. First operand 14280 states and 91340 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 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 22:06:59,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:06:59,982 INFO L93 Difference]: Finished difference Result 18152 states and 115281 transitions. [2025-04-13 22:06:59,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:06:59,982 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 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 33 [2025-04-13 22:06:59,982 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:07:00,071 INFO L225 Difference]: With dead ends: 18152 [2025-04-13 22:07:00,071 INFO L226 Difference]: Without dead ends: 16982 [2025-04-13 22:07:00,078 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:07:00,079 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 77 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:07:00,079 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 37 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:07:00,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16982 states. [2025-04-13 22:07:01,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16982 to 15901. [2025-04-13 22:07:01,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15901 states, 15900 states have (on average 6.398490566037736) internal successors, (101736), 15900 states have internal predecessors, (101736), 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 22:07:01,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15901 states to 15901 states and 101736 transitions. [2025-04-13 22:07:02,012 INFO L79 Accepts]: Start accepts. Automaton has 15901 states and 101736 transitions. Word has length 33 [2025-04-13 22:07:02,012 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:07:02,013 INFO L485 AbstractCegarLoop]: Abstraction has 15901 states and 101736 transitions. [2025-04-13 22:07:02,013 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 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 22:07:02,013 INFO L278 IsEmpty]: Start isEmpty. Operand 15901 states and 101736 transitions. [2025-04-13 22:07:02,054 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:07:02,055 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:07:02,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:07:02,060 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 22:07:02,255 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:07:02,255 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 22:07:02,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:07:02,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1434596342, now seen corresponding path program 2 times [2025-04-13 22:07:02,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:07:02,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272037400] [2025-04-13 22:07:02,256 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:07:02,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:07:02,260 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:07:02,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:07:02,266 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:07:02,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:07:02,329 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 22:07:02,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:07:02,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272037400] [2025-04-13 22:07:02,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272037400] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:07:02,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:07:02,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:07:02,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991405606] [2025-04-13 22:07:02,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:07:02,330 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:07:02,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:07:02,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:07:02,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:07:02,331 INFO L87 Difference]: Start difference. First operand 15901 states and 101736 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 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 22:07:04,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:07:04,554 INFO L93 Difference]: Finished difference Result 18151 states and 114112 transitions. [2025-04-13 22:07:04,554 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:07:04,554 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 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 33 [2025-04-13 22:07:04,554 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:07:04,654 INFO L225 Difference]: With dead ends: 18151 [2025-04-13 22:07:04,655 INFO L226 Difference]: Without dead ends: 16926 [2025-04-13 22:07:04,664 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:07:04,664 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 60 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:07:04,664 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 29 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:07:04,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16926 states. [2025-04-13 22:07:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16926 to 16412. [2025-04-13 22:07:06,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16412 states, 16411 states have (on average 6.352324660288831) internal successors, (104248), 16411 states have internal predecessors, (104248), 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 22:07:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16412 states to 16412 states and 104248 transitions. [2025-04-13 22:07:06,746 INFO L79 Accepts]: Start accepts. Automaton has 16412 states and 104248 transitions. Word has length 33 [2025-04-13 22:07:06,746 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:07:06,746 INFO L485 AbstractCegarLoop]: Abstraction has 16412 states and 104248 transitions. [2025-04-13 22:07:06,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 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 22:07:06,746 INFO L278 IsEmpty]: Start isEmpty. Operand 16412 states and 104248 transitions. [2025-04-13 22:07:06,794 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:07:06,794 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:07:06,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:07:06,795 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 22:07:06,795 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 22:07:06,795 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:07:06,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1525185493, now seen corresponding path program 2 times [2025-04-13 22:07:06,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:07:06,795 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708325608] [2025-04-13 22:07:06,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:07:06,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:07:06,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:07:06,804 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:07:06,804 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:07:06,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:07:06,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:07:06,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:07:06,844 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708325608] [2025-04-13 22:07:06,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708325608] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:07:06,844 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643319292] [2025-04-13 22:07:06,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:07:06,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:07:06,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:07:06,846 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 22:07:06,848 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 22:07:06,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:07:06,899 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:07:06,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:07:06,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:07:06,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 22:07:06,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:07:06,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:07:06,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:07:07,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:07:07,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643319292] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:07:07,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:07:07,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 22:07:07,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49305515] [2025-04-13 22:07:07,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:07:07,009 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:07:07,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:07:07,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:07:07,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:07:07,010 INFO L87 Difference]: Start difference. First operand 16412 states and 104248 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 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 22:07:09,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:07:09,982 INFO L93 Difference]: Finished difference Result 22480 states and 140376 transitions. [2025-04-13 22:07:09,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:07:09,982 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 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 33 [2025-04-13 22:07:09,982 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:07:10,103 INFO L225 Difference]: With dead ends: 22480 [2025-04-13 22:07:10,104 INFO L226 Difference]: Without dead ends: 20588 [2025-04-13 22:07:10,115 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:07:10,116 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 106 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:07:10,116 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 37 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:07:10,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20588 states. [2025-04-13 22:07:12,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20588 to 18912. [2025-04-13 22:07:12,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18912 states, 18911 states have (on average 6.334831579503993) internal successors, (119798), 18911 states have internal predecessors, (119798), 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 22:07:12,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18912 states to 18912 states and 119798 transitions. [2025-04-13 22:07:12,614 INFO L79 Accepts]: Start accepts. Automaton has 18912 states and 119798 transitions. Word has length 33 [2025-04-13 22:07:12,615 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:07:12,615 INFO L485 AbstractCegarLoop]: Abstraction has 18912 states and 119798 transitions. [2025-04-13 22:07:12,615 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 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 22:07:12,615 INFO L278 IsEmpty]: Start isEmpty. Operand 18912 states and 119798 transitions. [2025-04-13 22:07:12,671 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:07:12,671 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:07:12,671 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:07:12,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 22:07:12,872 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 22:07:12,872 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 22:07:12,872 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:07:12,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1416395562, now seen corresponding path program 2 times [2025-04-13 22:07:12,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:07:12,872 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952790958] [2025-04-13 22:07:12,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:07:12,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:07:12,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:07:12,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:07:12,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:07:12,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:07:12,930 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 22:07:12,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:07:12,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952790958] [2025-04-13 22:07:12,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952790958] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:07:12,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:07:12,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:07:12,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849194675] [2025-04-13 22:07:12,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:07:12,932 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:07:12,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:07:12,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:07:12,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:07:12,933 INFO L87 Difference]: Start difference. First operand 18912 states and 119798 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 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 22:07:16,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:07:16,083 INFO L93 Difference]: Finished difference Result 22460 states and 138452 transitions. [2025-04-13 22:07:16,086 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:07:16,087 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 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 33 [2025-04-13 22:07:16,087 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:07:16,213 INFO L225 Difference]: With dead ends: 22460 [2025-04-13 22:07:16,213 INFO L226 Difference]: Without dead ends: 20496 [2025-04-13 22:07:16,225 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:07:16,227 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 80 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:07:16,227 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 29 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:07:16,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20496 states. [2025-04-13 22:07:18,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20496 to 19680. [2025-04-13 22:07:18,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19680 states, 19679 states have (on average 6.273286244219727) internal successors, (123452), 19679 states have internal predecessors, (123452), 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 22:07:18,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19680 states to 19680 states and 123452 transitions. [2025-04-13 22:07:18,977 INFO L79 Accepts]: Start accepts. Automaton has 19680 states and 123452 transitions. Word has length 33 [2025-04-13 22:07:18,977 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:07:18,977 INFO L485 AbstractCegarLoop]: Abstraction has 19680 states and 123452 transitions. [2025-04-13 22:07:18,977 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 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 22:07:18,978 INFO L278 IsEmpty]: Start isEmpty. Operand 19680 states and 123452 transitions. [2025-04-13 22:07:19,029 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:07:19,029 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:07:19,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:07:19,029 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 22:07:19,029 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 22:07:19,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:07:19,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1031730526, now seen corresponding path program 2 times [2025-04-13 22:07:19,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:07:19,030 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490004703] [2025-04-13 22:07:19,030 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:07:19,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:07:19,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:07:19,037 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:07:19,037 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:07:19,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:07:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:07:19,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:07:19,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490004703] [2025-04-13 22:07:19,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490004703] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:07:19,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916531575] [2025-04-13 22:07:19,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:07:19,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:07:19,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:07:19,075 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 22:07:19,081 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 22:07:19,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:07:19,139 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:07:19,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:07:19,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:07:19,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 22:07:19,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:07:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:07:19,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:07:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:07:19,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916531575] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:07:19,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:07:19,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-04-13 22:07:19,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792772241] [2025-04-13 22:07:19,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:07:19,207 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:07:19,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:07:19,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:07:19,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:07:19,207 INFO L87 Difference]: Start difference. First operand 19680 states and 123452 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 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 22:07:23,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:07:23,298 INFO L93 Difference]: Finished difference Result 29268 states and 179300 transitions. [2025-04-13 22:07:23,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:07:23,298 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 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 33 [2025-04-13 22:07:23,298 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:07:23,439 INFO L225 Difference]: With dead ends: 29268 [2025-04-13 22:07:23,439 INFO L226 Difference]: Without dead ends: 26216 [2025-04-13 22:07:23,450 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:07:23,451 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 109 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:07:23,451 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 39 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:07:23,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26216 states. [2025-04-13 22:07:26,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26216 to 23202. [2025-04-13 22:07:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23202 states, 23201 states have (on average 6.257402698159562) internal successors, (145178), 23201 states have internal predecessors, (145178), 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 22:07:26,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23202 states to 23202 states and 145178 transitions. [2025-04-13 22:07:26,764 INFO L79 Accepts]: Start accepts. Automaton has 23202 states and 145178 transitions. Word has length 33 [2025-04-13 22:07:26,764 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:07:26,764 INFO L485 AbstractCegarLoop]: Abstraction has 23202 states and 145178 transitions. [2025-04-13 22:07:26,764 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 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 22:07:26,764 INFO L278 IsEmpty]: Start isEmpty. Operand 23202 states and 145178 transitions. [2025-04-13 22:07:26,825 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:07:26,825 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:07:26,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:07:26,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 22:07:27,026 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:07:27,026 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 22:07:27,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:07:27,026 INFO L85 PathProgramCache]: Analyzing trace with hash -358439695, now seen corresponding path program 2 times [2025-04-13 22:07:27,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:07:27,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012870779] [2025-04-13 22:07:27,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:07:27,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:07:27,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:07:27,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:07:27,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:07:27,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:07:27,079 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 22:07:27,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:07:27,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012870779] [2025-04-13 22:07:27,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012870779] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:07:27,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:07:27,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:07:27,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149340284] [2025-04-13 22:07:27,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:07:27,079 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:07:27,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:07:27,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:07:27,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:07:27,080 INFO L87 Difference]: Start difference. First operand 23202 states and 145178 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 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 22:07:31,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:07:31,631 INFO L93 Difference]: Finished difference Result 29668 states and 179596 transitions. [2025-04-13 22:07:31,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:07:31,631 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 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 33 [2025-04-13 22:07:31,631 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:07:31,787 INFO L225 Difference]: With dead ends: 29668 [2025-04-13 22:07:31,787 INFO L226 Difference]: Without dead ends: 26046 [2025-04-13 22:07:31,802 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:07:31,802 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 83 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:07:31,802 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 29 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:07:31,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26046 states. [2025-04-13 22:07:35,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26046 to 24390. [2025-04-13 22:07:35,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24390 states, 24389 states have (on average 6.196400016400837) internal successors, (151124), 24389 states have internal predecessors, (151124), 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 22:07:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24390 states to 24390 states and 151124 transitions. [2025-04-13 22:07:35,577 INFO L79 Accepts]: Start accepts. Automaton has 24390 states and 151124 transitions. Word has length 33 [2025-04-13 22:07:35,578 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:07:35,578 INFO L485 AbstractCegarLoop]: Abstraction has 24390 states and 151124 transitions. [2025-04-13 22:07:35,578 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 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 22:07:35,578 INFO L278 IsEmpty]: Start isEmpty. Operand 24390 states and 151124 transitions. [2025-04-13 22:07:35,643 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 22:07:35,643 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:07:35,643 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:07:35,643 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 22:07:35,643 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 22:07:35,644 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:07:35,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1448251081, now seen corresponding path program 1 times [2025-04-13 22:07:35,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:07:35,644 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798493933] [2025-04-13 22:07:35,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:07:35,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:07:35,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 22:07:35,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 22:07:35,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:07:35,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:07:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:07:36,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:07:36,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798493933] [2025-04-13 22:07:36,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798493933] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:07:36,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739814576] [2025-04-13 22:07:36,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:07:36,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:07:36,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:07:36,100 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 22:07:36,101 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 22:07:36,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 22:07:36,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 22:07:36,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:07:36,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:07:36,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 22:07:36,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:07:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:07:48,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:07:51,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:07:51,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739814576] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:07:51,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:07:51,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-13 22:07:51,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185347642] [2025-04-13 22:07:51,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:07:51,145 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:07:51,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:07:51,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:07:51,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:07:51,146 INFO L87 Difference]: Start difference. First operand 24390 states and 151124 transitions. Second operand has 16 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 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 22:07:55,605 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:07:59,610 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:08:04,311 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:08:06,479 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:08:10,481 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:08:14,484 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:08:16,233 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:08:20,825 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~n~0 4294967296)) (.cse2 (mod c_~x5~0 4294967296)) (.cse0 (mod (div c_~x2~0 2) 4294967296)) (.cse3 (mod c_~x3~0 4294967296))) (and (= (mod c_~x2~0 2) 0) (<= (+ .cse0 1) .cse1) (= (mod c_~x6~0 4294967296) .cse2) (= .cse3 (mod c_~x4~0 4294967296)) (= .cse0 (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296)) (= (mod c_~x1~0 2) 0) (<= .cse1 (mod c_~x2~0 4294967296)) (<= 1 .cse2) (= .cse0 (mod c_~x1~0 4294967296)) (<= 1 .cse3))) is different from false [2025-04-13 22:08:32,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:08:32,166 INFO L93 Difference]: Finished difference Result 42119 states and 249668 transitions. [2025-04-13 22:08:32,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:08:32,166 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 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 34 [2025-04-13 22:08:32,166 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:08:32,409 INFO L225 Difference]: With dead ends: 42119 [2025-04-13 22:08:32,409 INFO L226 Difference]: Without dead ends: 41342 [2025-04-13 22:08:32,423 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=132, Invalid=333, Unknown=1, NotChecked=40, Total=506 [2025-04-13 22:08:32,423 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 341 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 37 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 307 IncrementalHoareTripleChecker+Unchecked, 28.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:08:32,423 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 164 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 860 Invalid, 5 Unknown, 307 Unchecked, 28.0s Time] [2025-04-13 22:08:32,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41342 states. [2025-04-13 22:08:37,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41342 to 27440. [2025-04-13 22:08:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27440 states, 27439 states have (on average 6.22810598053865) internal successors, (170893), 27439 states have internal predecessors, (170893), 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 22:08:37,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27440 states to 27440 states and 170893 transitions. [2025-04-13 22:08:37,652 INFO L79 Accepts]: Start accepts. Automaton has 27440 states and 170893 transitions. Word has length 34 [2025-04-13 22:08:37,652 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:08:37,653 INFO L485 AbstractCegarLoop]: Abstraction has 27440 states and 170893 transitions. [2025-04-13 22:08:37,653 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 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 22:08:37,653 INFO L278 IsEmpty]: Start isEmpty. Operand 27440 states and 170893 transitions. [2025-04-13 22:08:37,730 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 22:08:37,730 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:08:37,730 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:08:37,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 22:08:37,931 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:08:37,931 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 22:08:37,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:08:37,931 INFO L85 PathProgramCache]: Analyzing trace with hash 88858625, now seen corresponding path program 1 times [2025-04-13 22:08:37,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:08:37,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717595981] [2025-04-13 22:08:37,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:08:37,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:08:37,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 22:08:37,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 22:08:37,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:08:37,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:08:38,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:08:38,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:08:38,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717595981] [2025-04-13 22:08:38,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717595981] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:08:38,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938851236] [2025-04-13 22:08:38,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:08:38,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:08:38,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:08:38,326 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 22:08:38,328 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 22:08:38,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 22:08:38,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 22:08:38,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:08:38,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:08:38,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 22:08:38,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:08:40,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:08:40,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:08:40,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:08:40,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938851236] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:08:40,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:08:40,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-13 22:08:40,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396789361] [2025-04-13 22:08:40,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:08:40,995 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:08:40,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:08:40,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:08:40,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:08:40,995 INFO L87 Difference]: Start difference. First operand 27440 states and 170893 transitions. Second operand has 16 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 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 22:08:53,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:08:53,769 INFO L93 Difference]: Finished difference Result 46443 states and 276829 transitions. [2025-04-13 22:08:53,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:08:53,770 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 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 34 [2025-04-13 22:08:53,770 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:08:54,062 INFO L225 Difference]: With dead ends: 46443 [2025-04-13 22:08:54,062 INFO L226 Difference]: Without dead ends: 43478 [2025-04-13 22:08:54,079 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:08:54,080 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 362 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:08:54,080 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 179 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-04-13 22:08:54,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43478 states. [2025-04-13 22:09:00,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43478 to 31139. [2025-04-13 22:09:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31139 states, 31138 states have (on average 6.227471256985035) internal successors, (193911), 31138 states have internal predecessors, (193911), 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 22:09:00,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31139 states to 31139 states and 193911 transitions. [2025-04-13 22:09:00,709 INFO L79 Accepts]: Start accepts. Automaton has 31139 states and 193911 transitions. Word has length 34 [2025-04-13 22:09:00,709 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:09:00,709 INFO L485 AbstractCegarLoop]: Abstraction has 31139 states and 193911 transitions. [2025-04-13 22:09:00,709 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 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 22:09:00,709 INFO L278 IsEmpty]: Start isEmpty. Operand 31139 states and 193911 transitions. [2025-04-13 22:09:00,810 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 22:09:00,811 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:09:00,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:09:00,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 22:09:01,011 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,SelfDestructingSolverStorable14 [2025-04-13 22:09:01,011 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 22:09:01,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:09:01,012 INFO L85 PathProgramCache]: Analyzing trace with hash -631339997, now seen corresponding path program 1 times [2025-04-13 22:09:01,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:09:01,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390652249] [2025-04-13 22:09:01,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:09:01,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:09:01,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 22:09:01,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 22:09:01,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:09:01,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:09:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:09:01,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:09:01,327 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390652249] [2025-04-13 22:09:01,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390652249] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:09:01,327 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299674926] [2025-04-13 22:09:01,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:09:01,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:09:01,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:09:01,330 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 22:09:01,331 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 22:09:01,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 22:09:01,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 22:09:01,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:09:01,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:09:01,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 22:09:01,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:10:52,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:10:52,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:11:16,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:11:16,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299674926] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:11:16,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:11:16,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-13 22:11:16,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168404558] [2025-04-13 22:11:16,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:11:16,244 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:11:16,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:11:16,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:11:16,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=167, Unknown=16, NotChecked=0, Total=240 [2025-04-13 22:11:16,245 INFO L87 Difference]: Start difference. First operand 31139 states and 193911 transitions. Second operand has 16 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 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 22:11:24,422 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:11:28,427 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:11:32,431 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:11:36,437 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:11:48,751 WARN L286 SmtUtils]: Spent 5.25s on a formula simplification. DAG size of input: 54 DAG size of output: 43 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:11:52,753 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:11:54,310 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:11:59,982 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:12:01,741 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:12:05,791 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:12:11,012 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:12:18,080 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:12:31,924 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:12:34,641 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:12:41,882 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:12:44,140 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:12:45,421 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:12:47,235 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:12:51,236 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:12:55,290 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:12:59,501 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:13:02,874 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:13:05,115 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:13:09,422 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:13:21,554 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 44 DAG size of output: 41 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:13:24,805 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:13:33,401 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:13:35,455 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:13:43,935 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:13:50,246 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:13:51,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:51,090 INFO L93 Difference]: Finished difference Result 47446 states and 286599 transitions. [2025-04-13 22:13:51,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:13:51,091 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 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 34 [2025-04-13 22:13:51,091 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:51,334 INFO L225 Difference]: With dead ends: 47446 [2025-04-13 22:13:51,335 INFO L226 Difference]: Without dead ends: 45045 [2025-04-13 22:13:51,352 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 128.8s TimeCoverageRelationStatistics Valid=137, Invalid=395, Unknown=20, NotChecked=0, Total=552 [2025-04-13 22:13:51,353 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 307 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 34 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 102.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 103.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:51,353 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 220 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 937 Invalid, 17 Unknown, 0 Unchecked, 103.1s Time] [2025-04-13 22:13:51,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45045 states. [2025-04-13 22:13:58,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45045 to 34234. [2025-04-13 22:13:58,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34234 states, 34233 states have (on average 6.2149680133204805) internal successors, (212757), 34233 states have internal predecessors, (212757), 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 22:13:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34234 states to 34234 states and 212757 transitions. [2025-04-13 22:13:59,078 INFO L79 Accepts]: Start accepts. Automaton has 34234 states and 212757 transitions. Word has length 34 [2025-04-13 22:13:59,079 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:59,079 INFO L485 AbstractCegarLoop]: Abstraction has 34234 states and 212757 transitions. [2025-04-13 22:13:59,079 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 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 22:13:59,079 INFO L278 IsEmpty]: Start isEmpty. Operand 34234 states and 212757 transitions. [2025-04-13 22:13:59,170 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 22:13:59,170 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:59,170 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:59,176 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 22:13:59,371 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 22:13:59,371 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 22:13:59,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:59,371 INFO L85 PathProgramCache]: Analyzing trace with hash 795592159, now seen corresponding path program 2 times [2025-04-13 22:13:59,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:59,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839037343] [2025-04-13 22:13:59,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:59,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:59,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 22:13:59,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 22:13:59,391 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:59,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:00,161 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 22:14:00,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:00,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839037343] [2025-04-13 22:14:00,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839037343] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:00,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114460195] [2025-04-13 22:14:00,161 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:14:00,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:00,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:00,163 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 22:14:00,164 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 22:14:00,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 22:14:00,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 22:14:00,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:14:00,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:00,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 22:14:00,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:23,181 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 22:14:23,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:24,792 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 22:14:24,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114460195] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:24,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:24,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-13 22:14:24,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737460890] [2025-04-13 22:14:24,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:24,793 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:14:24,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:24,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:14:24,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=156, Unknown=1, NotChecked=0, Total=240 [2025-04-13 22:14:24,793 INFO L87 Difference]: Start difference. First operand 34234 states and 212757 transitions. Second operand has 16 states, 15 states have (on average 6.4) internal successors, (96), 15 states have internal predecessors, (96), 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 22:14:34,408 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification. DAG size of input: 50 DAG size of output: 45 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:14:41,226 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:14:45,728 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:14:49,983 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:15:05,929 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:15:10,301 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:15:22,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:22,240 INFO L93 Difference]: Finished difference Result 52612 states and 320687 transitions. [2025-04-13 22:15:22,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:15:22,241 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.4) internal successors, (96), 15 states have internal predecessors, (96), 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 34 [2025-04-13 22:15:22,241 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:22,510 INFO L225 Difference]: With dead ends: 52612 [2025-04-13 22:15:22,510 INFO L226 Difference]: Without dead ends: 49466 [2025-04-13 22:15:22,531 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 35.8s TimeCoverageRelationStatistics Valid=139, Invalid=279, Unknown=2, NotChecked=0, Total=420 [2025-04-13 22:15:22,531 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 210 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 32 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:22,531 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 202 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 898 Invalid, 2 Unknown, 0 Unchecked, 30.5s Time] [2025-04-13 22:15:22,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49466 states. [2025-04-13 22:15:31,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49466 to 36180. [2025-04-13 22:15:31,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36180 states, 36179 states have (on average 6.245335691976008) internal successors, (225950), 36179 states have internal predecessors, (225950), 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 22:15:31,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36180 states to 36180 states and 225950 transitions. [2025-04-13 22:15:31,688 INFO L79 Accepts]: Start accepts. Automaton has 36180 states and 225950 transitions. Word has length 34 [2025-04-13 22:15:31,688 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:31,688 INFO L485 AbstractCegarLoop]: Abstraction has 36180 states and 225950 transitions. [2025-04-13 22:15:31,688 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.4) internal successors, (96), 15 states have internal predecessors, (96), 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 22:15:31,688 INFO L278 IsEmpty]: Start isEmpty. Operand 36180 states and 225950 transitions. [2025-04-13 22:15:31,783 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 22:15:31,783 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:31,783 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:31,790 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 22:15:31,983 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,SelfDestructingSolverStorable16 [2025-04-13 22:15:31,984 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 22:15:31,984 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:31,984 INFO L85 PathProgramCache]: Analyzing trace with hash -686684603, now seen corresponding path program 2 times [2025-04-13 22:15:31,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:31,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799747376] [2025-04-13 22:15:31,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:31,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:31,987 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 22:15:32,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 22:15:32,001 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:32,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:32,778 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 22:15:32,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:32,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799747376] [2025-04-13 22:15:32,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799747376] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:32,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312602970] [2025-04-13 22:15:32,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:32,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:32,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:32,781 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 22:15:32,782 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 22:15:32,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 22:15:32,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 22:15:32,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:32,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:32,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 22:15:32,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:34,275 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 22:15:34,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:34,871 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 22:15:34,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312602970] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:34,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:34,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-13 22:15:34,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172941349] [2025-04-13 22:15:34,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:34,872 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:15:34,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:34,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:15:34,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:15:34,873 INFO L87 Difference]: Start difference. First operand 36180 states and 225950 transitions. Second operand has 16 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 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 22:15:38,467 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:16:02,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:02,458 INFO L93 Difference]: Finished difference Result 62129 states and 374399 transitions. [2025-04-13 22:16:02,460 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:16:02,460 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 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 34 [2025-04-13 22:16:02,460 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:02,957 INFO L225 Difference]: With dead ends: 62129 [2025-04-13 22:16:02,958 INFO L226 Difference]: Without dead ends: 57980 [2025-04-13 22:16:02,992 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=199, Invalid=503, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:16:02,993 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 477 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:02,998 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 206 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2025-04-13 22:16:03,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57980 states. [2025-04-13 22:16:15,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57980 to 39070. [2025-04-13 22:16:15,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39070 states, 39069 states have (on average 6.273925618777035) internal successors, (245116), 39069 states have internal predecessors, (245116), 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 22:16:16,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39070 states to 39070 states and 245116 transitions. [2025-04-13 22:16:16,196 INFO L79 Accepts]: Start accepts. Automaton has 39070 states and 245116 transitions. Word has length 34 [2025-04-13 22:16:16,197 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:16,197 INFO L485 AbstractCegarLoop]: Abstraction has 39070 states and 245116 transitions. [2025-04-13 22:16:16,198 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 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 22:16:16,198 INFO L278 IsEmpty]: Start isEmpty. Operand 39070 states and 245116 transitions. [2025-04-13 22:16:16,457 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 22:16:16,458 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:16,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:16,478 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 22:16:16,663 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,SelfDestructingSolverStorable17 [2025-04-13 22:16:16,668 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 22:16:16,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:16,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1617174703, now seen corresponding path program 2 times [2025-04-13 22:16:16,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:16,669 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032185133] [2025-04-13 22:16:16,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:16:16,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:16,693 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 22:16:16,805 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 22:16:16,806 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:16:16,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:17,484 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 22:16:17,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:17,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032185133] [2025-04-13 22:16:17,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032185133] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:17,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705514356] [2025-04-13 22:16:17,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:16:17,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:17,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:17,488 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 22:16:17,489 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 22:16:17,541 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 22:16:17,682 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 22:16:17,682 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:16:17,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:17,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 22:16:17,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:00,647 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 22:17:00,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:01,897 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 22:17:01,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705514356] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:01,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:01,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-13 22:17:01,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413911737] [2025-04-13 22:17:01,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:01,898 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:17:01,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:01,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:17:01,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=160, Unknown=3, NotChecked=0, Total=240 [2025-04-13 22:17:01,899 INFO L87 Difference]: Start difference. First operand 39070 states and 245116 transitions. Second operand has 16 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 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 22:17:15,545 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:17:19,554 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:17:23,561 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:17:25,221 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:17:27,836 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:17:31,428 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:17:35,910 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:17:39,913 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:17:45,067 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:17:49,070 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:17:53,072 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:17:54,592 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:17:58,855 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:18:04,957 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:18:15,317 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:18:19,359 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:18:20,826 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:18:41,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:41,750 INFO L93 Difference]: Finished difference Result 59608 states and 363351 transitions. [2025-04-13 22:18:41,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:18:41,751 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 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 34 [2025-04-13 22:18:41,752 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:42,269 INFO L225 Difference]: With dead ends: 59608 [2025-04-13 22:18:42,269 INFO L226 Difference]: Without dead ends: 54691 [2025-04-13 22:18:42,301 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 46.1s TimeCoverageRelationStatistics Valid=125, Invalid=332, Unknown=5, NotChecked=0, Total=462 [2025-04-13 22:18:42,303 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 352 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 27 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 67.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:42,303 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 174 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1001 Invalid, 8 Unknown, 0 Unchecked, 67.0s Time] [2025-04-13 22:18:42,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54691 states. [2025-04-13 22:18:55,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54691 to 42078. [2025-04-13 22:18:56,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42078 states, 42077 states have (on average 6.28637973239537) internal successors, (264512), 42077 states have internal predecessors, (264512), 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 22:18:56,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42078 states to 42078 states and 264512 transitions. [2025-04-13 22:18:56,421 INFO L79 Accepts]: Start accepts. Automaton has 42078 states and 264512 transitions. Word has length 34 [2025-04-13 22:18:56,421 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:56,422 INFO L485 AbstractCegarLoop]: Abstraction has 42078 states and 264512 transitions. [2025-04-13 22:18:56,422 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 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 22:18:56,422 INFO L278 IsEmpty]: Start isEmpty. Operand 42078 states and 264512 transitions. [2025-04-13 22:18:56,636 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:18:56,636 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:56,636 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:56,646 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 22:18:56,837 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:56,837 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 22:18:56,838 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:56,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1942053139, now seen corresponding path program 3 times [2025-04-13 22:18:56,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:56,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044468016] [2025-04-13 22:18:56,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:18:56,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:56,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:18:56,938 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:18:56,938 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:18:56,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:57,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:18:57,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:57,463 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044468016] [2025-04-13 22:18:57,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044468016] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:57,463 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381689890] [2025-04-13 22:18:57,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:18:57,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:57,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:57,471 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 22:18:57,485 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 22:18:57,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:18:57,716 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:18:57,716 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:18:57,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:57,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 22:18:57,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:58,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:18:58,605 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:59,866 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 22:18:59,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381689890] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:59,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:59,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2025-04-13 22:18:59,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96635321] [2025-04-13 22:18:59,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:59,867 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:18:59,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:59,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:18:59,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:18:59,868 INFO L87 Difference]: Start difference. First operand 42078 states and 264512 transitions. Second operand has 16 states, 16 states have (on average 5.0) internal successors, (80), 15 states have internal predecessors, (80), 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 22:20:00,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:00,449 INFO L93 Difference]: Finished difference Result 117777 states and 738759 transitions. [2025-04-13 22:20:00,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:20:00,450 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0) internal successors, (80), 15 states have internal predecessors, (80), 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 35 [2025-04-13 22:20:00,451 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:01,754 INFO L225 Difference]: With dead ends: 117777 [2025-04-13 22:20:01,754 INFO L226 Difference]: Without dead ends: 108376 [2025-04-13 22:20:01,813 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=282, Invalid=773, Unknown=1, NotChecked=0, Total=1056 [2025-04-13 22:20:01,814 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 645 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:01,814 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 326 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2025-04-13 22:20:01,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108376 states. Received shutdown request... [2025-04-13 22:20:02,613 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-13 22:20:02,622 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 22:20:02,623 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 22:20:02,625 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 22:20:02,814 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,SelfDestructingSolverStorable19 [2025-04-13 22:20:02,815 WARN L610 AbstractCegarLoop]: Verification canceled: while executing MinimizeSevpa. [2025-04-13 22:20:02,821 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2025-04-13 22:20:02,821 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-13 22:20:02,821 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-13 22:20:02,821 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-04-13 22:20:02,821 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-04-13 22:20:02,821 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2025-04-13 22:20:02,828 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 2, 2, 2, 2, 1] [2025-04-13 22:20:02,831 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:20:02,831 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:20:02,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:20:02 BasicIcfg [2025-04-13 22:20:02,839 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:20:02,840 INFO L158 Benchmark]: Toolchain (without parser) took 805592.02ms. Allocated memory was 155.2MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 107.6MB in the beginning and 723.5MB in the end (delta: -615.9MB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2025-04-13 22:20:02,840 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 159.4MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:20:02,841 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.06ms. Allocated memory is still 155.2MB. Free memory was 106.9MB in the beginning and 91.9MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 22:20:02,841 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.46ms. Allocated memory is still 155.2MB. Free memory was 91.9MB in the beginning and 90.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:20:02,841 INFO L158 Benchmark]: Boogie Preprocessor took 37.21ms. Allocated memory is still 155.2MB. Free memory was 90.5MB in the beginning and 88.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:20:02,841 INFO L158 Benchmark]: IcfgBuilder took 512.52ms. Allocated memory is still 155.2MB. Free memory was 88.4MB in the beginning and 50.0MB in the end (delta: 38.4MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-13 22:20:02,842 INFO L158 Benchmark]: TraceAbstraction took 804785.93ms. Allocated memory was 155.2MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 49.3MB in the beginning and 723.5MB in the end (delta: -674.2MB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2025-04-13 22:20:02,843 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.24ms. Allocated memory is still 159.4MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 222.06ms. Allocated memory is still 155.2MB. Free memory was 106.9MB in the beginning and 91.9MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.46ms. Allocated memory is still 155.2MB. Free memory was 91.9MB in the beginning and 90.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 37.21ms. Allocated memory is still 155.2MB. Free memory was 90.5MB in the beginning and 88.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 512.52ms. Allocated memory is still 155.2MB. Free memory was 88.4MB in the beginning and 50.0MB in the end (delta: 38.4MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 804785.93ms. Allocated memory was 155.2MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 49.3MB in the beginning and 723.5MB in the end (delta: -674.2MB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 64 locations, 75 edges, 7 error locations. Started 1 CEGAR loops. OverallTime: 804.7s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 1.4s, AutomataDifference: 487.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 32 mSolverCounterUnknown, 3703 SdHoareTripleChecker+Valid, 245.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3703 mSDsluCounter, 1891 SdHoareTripleChecker+Invalid, 244.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 307 IncrementalHoareTripleChecker+Unchecked, 1509 mSDsCounter, 282 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8935 IncrementalHoareTripleChecker+Invalid, 9556 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 282 mSolverCounterUnsat, 382 mSDtfsCounter, 8935 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 995 GetRequests, 774 SyntacticMatches, 14 SemanticMatches, 207 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 235.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42078occurred in iteration=19, InterpolantAutomatonStates: 192, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 79.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 102958 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 231.1s InterpolantComputationTime, 1104 NumberOfCodeBlocks, 1104 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1495 ConstructedInterpolants, 0 QuantifiedInterpolants, 30413 SizeOfPredicates, 43 NumberOfNonLiveVariables, 3209 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 46 InterpolantComputations, 7 PerfectInterpolantSequences, 8/81 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown