/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/chl-nzb-file-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:17:05,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:17:05,991 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:17:05,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:17:05,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:17:06,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:17:06,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:17:06,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:17:06,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:17:06,021 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:17:06,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:17:06,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:17:06,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:17:06,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:17:06,023 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:17:06,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:17:06,023 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:17:06,023 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:17:06,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:17:06,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:17:06,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:17:06,024 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:17:06,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:17:06,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:17:06,024 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:17:06,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:17:06,024 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:17:06,024 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:17:06,024 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:17:06,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:17:06,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:17:06,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:17:06,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:17:06,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:17:06,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:17:06,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:17:06,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:17:06,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:17:06,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:17:06,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:17:06,025 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:17:06,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:17:06,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:17:06,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:17:06,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:17:06,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:17:06,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:17:06,025 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:17:06,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:17:06,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:17:06,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:17:06,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:17:06,248 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:17:06,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-nzb-file-subst.wvr.c [2025-04-13 22:17:07,466 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb6cc714a/87b395a93657496fb7ce8f7946ab3d98/FLAG95cb965c8 [2025-04-13 22:17:07,671 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:17:07,671 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-subst.wvr.c [2025-04-13 22:17:07,680 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb6cc714a/87b395a93657496fb7ce8f7946ab3d98/FLAG95cb965c8 [2025-04-13 22:17:08,468 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb6cc714a/87b395a93657496fb7ce8f7946ab3d98 [2025-04-13 22:17:08,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:17:08,471 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:17:08,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:17:08,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:17:08,478 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:17:08,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:17:08" (1/1) ... [2025-04-13 22:17:08,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cd987aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:17:08, skipping insertion in model container [2025-04-13 22:17:08,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:17:08" (1/1) ... [2025-04-13 22:17:08,491 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:17:08,690 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/chl-nzb-file-subst.wvr.c[6540,6553] [2025-04-13 22:17:08,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:17:08,707 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:17:08,761 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/chl-nzb-file-subst.wvr.c[6540,6553] [2025-04-13 22:17:08,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:17:08,777 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:17:08,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:17:08 WrapperNode [2025-04-13 22:17:08,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:17:08,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:17:08,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:17:08,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:17:08,783 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:17:08" (1/1) ... [2025-04-13 22:17:08,792 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:17:08" (1/1) ... [2025-04-13 22:17:08,821 INFO L138 Inliner]: procedures = 25, calls = 61, calls flagged for inlining = 28, calls inlined = 42, statements flattened = 591 [2025-04-13 22:17:08,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:17:08,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:17:08,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:17:08,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:17:08,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:17:08" (1/1) ... [2025-04-13 22:17:08,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:17:08" (1/1) ... [2025-04-13 22:17:08,838 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:17:08" (1/1) ... [2025-04-13 22:17:08,856 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-13 22:17:08,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:17:08" (1/1) ... [2025-04-13 22:17:08,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:17:08" (1/1) ... [2025-04-13 22:17:08,865 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:17:08" (1/1) ... [2025-04-13 22:17:08,866 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:17:08" (1/1) ... [2025-04-13 22:17:08,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:17:08" (1/1) ... [2025-04-13 22:17:08,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:17:08" (1/1) ... [2025-04-13 22:17:08,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:17:08,877 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:17:08,877 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:17:08,877 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:17:08,878 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:17:08" (1/1) ... [2025-04-13 22:17:08,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:17:08,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:08,904 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:17:08,907 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:17:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:17:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:17:08,925 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:17:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:17:08,925 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:17:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:17:08,925 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:17:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:17:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 22:17:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 22:17:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 22:17:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 22:17:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:17:08,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:17:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 22:17:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 22:17:08,927 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:17:09,035 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:17:09,037 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:17:09,593 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:17:09,594 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:17:09,594 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:17:10,436 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:17:10,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:17:10 BoogieIcfgContainer [2025-04-13 22:17:10,437 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:17:10,438 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:17:10,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:17:10,441 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:17:10,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:17:08" (1/3) ... [2025-04-13 22:17:10,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209042e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:17:10, skipping insertion in model container [2025-04-13 22:17:10,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:17:08" (2/3) ... [2025-04-13 22:17:10,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209042e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:17:10, skipping insertion in model container [2025-04-13 22:17:10,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:17:10" (3/3) ... [2025-04-13 22:17:10,442 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-subst.wvr.c [2025-04-13 22:17:10,452 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:17:10,453 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-subst.wvr.c that has 4 procedures, 25 locations, 30 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 22:17:10,454 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:17:10,560 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 22:17:10,581 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 33 transitions, 87 flow [2025-04-13 22:17:10,605 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 97 states, 96 states have (on average 3.8854166666666665) internal successors, (373), 96 states have internal predecessors, (373), 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:10,626 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:17:10,636 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;@4d912809, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:17:10,638 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 22:17:10,640 INFO L278 IsEmpty]: Start isEmpty. Operand has 97 states, 96 states have (on average 3.8854166666666665) internal successors, (373), 96 states have internal predecessors, (373), 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:10,645 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 22:17:10,645 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:10,646 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:10,646 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:10,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:10,652 INFO L85 PathProgramCache]: Analyzing trace with hash -307321029, now seen corresponding path program 1 times [2025-04-13 22:17:10,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:10,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733591742] [2025-04-13 22:17:10,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:17:10,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:10,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 22:17:10,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 22:17:10,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:10,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:11,009 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:17:11,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:11,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733591742] [2025-04-13 22:17:11,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733591742] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:11,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:11,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:17:11,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114336360] [2025-04-13 22:17:11,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:11,017 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:17:11,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:11,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:17:11,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:17:11,035 INFO L87 Difference]: Start difference. First operand has 97 states, 96 states have (on average 3.8854166666666665) internal successors, (373), 96 states have internal predecessors, (373), 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, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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:11,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:11,141 INFO L93 Difference]: Finished difference Result 195 states and 749 transitions. [2025-04-13 22:17:11,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:17:11,146 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 22:17:11,146 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:11,152 INFO L225 Difference]: With dead ends: 195 [2025-04-13 22:17:11,152 INFO L226 Difference]: Without dead ends: 100 [2025-04-13 22:17:11,154 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:17:11,158 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:11,159 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:11,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-13 22:17:11,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-04-13 22:17:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 3.797979797979798) internal successors, (376), 99 states have internal predecessors, (376), 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:11,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 376 transitions. [2025-04-13 22:17:11,187 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 376 transitions. Word has length 17 [2025-04-13 22:17:11,188 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:11,188 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 376 transitions. [2025-04-13 22:17:11,189 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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:11,189 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 376 transitions. [2025-04-13 22:17:11,190 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:17:11,190 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:11,190 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] [2025-04-13 22:17:11,190 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:17:11,190 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:11,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:11,191 INFO L85 PathProgramCache]: Analyzing trace with hash 179713620, now seen corresponding path program 1 times [2025-04-13 22:17:11,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:11,191 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174409165] [2025-04-13 22:17:11,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:17:11,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:11,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:17:11,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:11,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:11,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:11,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:17:11,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:11,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174409165] [2025-04-13 22:17:11,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174409165] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:11,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023226663] [2025-04-13 22:17:11,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:17:11,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:11,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:11,432 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:17:11,433 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:17:11,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:17:11,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:11,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:11,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:11,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 22:17:11,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:17:11,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:11,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:17:11,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023226663] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:11,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:11,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-04-13 22:17:11,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704713273] [2025-04-13 22:17:11,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:11,712 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:17:11,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:11,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:17:11,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:17:11,713 INFO L87 Difference]: Start difference. First operand 100 states and 376 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 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:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:11,845 INFO L93 Difference]: Finished difference Result 206 states and 766 transitions. [2025-04-13 22:17:11,845 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:17:11,845 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 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 20 [2025-04-13 22:17:11,845 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:11,846 INFO L225 Difference]: With dead ends: 206 [2025-04-13 22:17:11,846 INFO L226 Difference]: Without dead ends: 109 [2025-04-13 22:17:11,847 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:17:11,847 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:11,848 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:11,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-04-13 22:17:11,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-04-13 22:17:11,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 3.564814814814815) internal successors, (385), 108 states have internal predecessors, (385), 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:11,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 385 transitions. [2025-04-13 22:17:11,856 INFO L79 Accepts]: Start accepts. Automaton has 109 states and 385 transitions. Word has length 20 [2025-04-13 22:17:11,856 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:11,856 INFO L485 AbstractCegarLoop]: Abstraction has 109 states and 385 transitions. [2025-04-13 22:17:11,856 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 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:11,857 INFO L278 IsEmpty]: Start isEmpty. Operand 109 states and 385 transitions. [2025-04-13 22:17:11,857 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:11,857 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:11,857 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:11,866 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:17:12,062 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:17:12,062 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:12,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:12,063 INFO L85 PathProgramCache]: Analyzing trace with hash 57968507, now seen corresponding path program 2 times [2025-04-13 22:17:12,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:12,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586803345] [2025-04-13 22:17:12,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:12,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:12,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:12,212 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 29 statements. [2025-04-13 22:17:12,212 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:17:12,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:13,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:13,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586803345] [2025-04-13 22:17:13,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586803345] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:13,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:13,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:17:13,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297109025] [2025-04-13 22:17:13,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:13,258 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:17:13,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:13,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:17:13,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:17:13,258 INFO L87 Difference]: Start difference. First operand 109 states and 385 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:13,549 INFO L93 Difference]: Finished difference Result 201 states and 645 transitions. [2025-04-13 22:17:13,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:17:13,550 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 29 [2025-04-13 22:17:13,550 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:13,552 INFO L225 Difference]: With dead ends: 201 [2025-04-13 22:17:13,552 INFO L226 Difference]: Without dead ends: 195 [2025-04-13 22:17:13,552 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:17:13,552 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:13,552 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:17:13,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-04-13 22:17:13,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 122. [2025-04-13 22:17:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 3.43801652892562) internal successors, (416), 121 states have internal predecessors, (416), 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:13,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 416 transitions. [2025-04-13 22:17:13,567 INFO L79 Accepts]: Start accepts. Automaton has 122 states and 416 transitions. Word has length 29 [2025-04-13 22:17:13,567 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:13,567 INFO L485 AbstractCegarLoop]: Abstraction has 122 states and 416 transitions. [2025-04-13 22:17:13,567 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:13,567 INFO L278 IsEmpty]: Start isEmpty. Operand 122 states and 416 transitions. [2025-04-13 22:17:13,568 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:13,568 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:13,568 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:13,568 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:17:13,568 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:13,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:13,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1745985267, now seen corresponding path program 3 times [2025-04-13 22:17:13,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:13,569 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608964558] [2025-04-13 22:17:13,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:17:13,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:13,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-04-13 22:17:13,653 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 29 statements. [2025-04-13 22:17:13,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:17:13,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:14,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:14,329 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608964558] [2025-04-13 22:17:14,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608964558] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:14,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:14,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:17:14,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778188918] [2025-04-13 22:17:14,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:14,329 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:17:14,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:14,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:17:14,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:17:14,330 INFO L87 Difference]: Start difference. First operand 122 states and 416 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:14,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:14,571 INFO L93 Difference]: Finished difference Result 209 states and 660 transitions. [2025-04-13 22:17:14,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:17:14,571 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 29 [2025-04-13 22:17:14,571 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:14,574 INFO L225 Difference]: With dead ends: 209 [2025-04-13 22:17:14,574 INFO L226 Difference]: Without dead ends: 203 [2025-04-13 22:17:14,574 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:17:14,575 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:14,575 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:17:14,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-04-13 22:17:14,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 125. [2025-04-13 22:17:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 3.3951612903225805) internal successors, (421), 124 states have internal predecessors, (421), 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:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 421 transitions. [2025-04-13 22:17:14,602 INFO L79 Accepts]: Start accepts. Automaton has 125 states and 421 transitions. Word has length 29 [2025-04-13 22:17:14,602 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:14,603 INFO L485 AbstractCegarLoop]: Abstraction has 125 states and 421 transitions. [2025-04-13 22:17:14,603 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:14,603 INFO L278 IsEmpty]: Start isEmpty. Operand 125 states and 421 transitions. [2025-04-13 22:17:14,604 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:14,604 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:14,604 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:14,604 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:17:14,604 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:14,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:14,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1308935545, now seen corresponding path program 4 times [2025-04-13 22:17:14,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:14,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020623064] [2025-04-13 22:17:14,605 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:17:14,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:14,627 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:14,644 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:14,644 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:17:14,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:14,786 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:17:14,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:14,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020623064] [2025-04-13 22:17:14,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020623064] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:14,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685045196] [2025-04-13 22:17:14,786 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:17:14,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:14,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:14,789 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:17:14,790 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:17:14,958 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:15,002 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:15,002 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:17:15,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:15,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 22:17:15,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:15,065 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:17:15,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:15,097 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:17:15,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685045196] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:15,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:15,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-13 22:17:15,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358064841] [2025-04-13 22:17:15,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:15,098 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:17:15,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:15,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:17:15,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:17:15,098 INFO L87 Difference]: Start difference. First operand 125 states and 421 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:15,206 INFO L93 Difference]: Finished difference Result 247 states and 841 transitions. [2025-04-13 22:17:15,207 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:17:15,207 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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 29 [2025-04-13 22:17:15,207 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:15,208 INFO L225 Difference]: With dead ends: 247 [2025-04-13 22:17:15,208 INFO L226 Difference]: Without dead ends: 128 [2025-04-13 22:17:15,208 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:17:15,209 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:15,209 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:15,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-04-13 22:17:15,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-04-13 22:17:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 3.338582677165354) internal successors, (424), 127 states have internal predecessors, (424), 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,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 424 transitions. [2025-04-13 22:17:15,215 INFO L79 Accepts]: Start accepts. Automaton has 128 states and 424 transitions. Word has length 29 [2025-04-13 22:17:15,215 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:15,215 INFO L485 AbstractCegarLoop]: Abstraction has 128 states and 424 transitions. [2025-04-13 22:17:15,215 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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,216 INFO L278 IsEmpty]: Start isEmpty. Operand 128 states and 424 transitions. [2025-04-13 22:17:15,216 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 22:17:15,216 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:15,216 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:15,223 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:17:15,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:15,421 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:15,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:15,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1217778400, now seen corresponding path program 5 times [2025-04-13 22:17:15,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:15,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441419399] [2025-04-13 22:17:15,422 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:17:15,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:15,448 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 4 equivalence classes. [2025-04-13 22:17:15,564 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 22:17:15,564 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:17:15,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:17,114 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-04-13 22:17:17,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:17,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441419399] [2025-04-13 22:17:17,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441419399] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:17,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197547933] [2025-04-13 22:17:17,114 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:17:17,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:17,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:17,116 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:17:17,118 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:17:17,306 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 4 equivalence classes. [2025-04-13 22:17:17,452 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 22:17:17,453 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:17:17,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:17,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 22:17:17,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:18,401 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:17:18,401 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:17:18,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197547933] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:18,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:17:18,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2025-04-13 22:17:18,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712525190] [2025-04-13 22:17:18,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:18,401 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:17:18,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:18,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:17:18,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:17:18,403 INFO L87 Difference]: Start difference. First operand 128 states and 424 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:18,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:18,904 INFO L93 Difference]: Finished difference Result 182 states and 545 transitions. [2025-04-13 22:17:18,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:17:18,904 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:17:18,904 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:18,906 INFO L225 Difference]: With dead ends: 182 [2025-04-13 22:17:18,906 INFO L226 Difference]: Without dead ends: 176 [2025-04-13 22:17:18,906 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:17:18,906 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:18,906 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:17:18,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-04-13 22:17:18,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 132. [2025-04-13 22:17:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 3.351145038167939) internal successors, (439), 131 states have internal predecessors, (439), 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:18,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 439 transitions. [2025-04-13 22:17:18,919 INFO L79 Accepts]: Start accepts. Automaton has 132 states and 439 transitions. Word has length 32 [2025-04-13 22:17:18,919 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:18,919 INFO L485 AbstractCegarLoop]: Abstraction has 132 states and 439 transitions. [2025-04-13 22:17:18,919 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:18,919 INFO L278 IsEmpty]: Start isEmpty. Operand 132 states and 439 transitions. [2025-04-13 22:17:18,920 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 22:17:18,920 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:18,920 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:18,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 22:17:19,120 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:17:19,120 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:19,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:19,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1262971496, now seen corresponding path program 6 times [2025-04-13 22:17:19,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:19,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442261831] [2025-04-13 22:17:19,121 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:17:19,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:19,144 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 4 equivalence classes. [2025-04-13 22:17:19,183 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 32 statements. [2025-04-13 22:17:19,183 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:17:19,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:19,672 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:17:19,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:19,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442261831] [2025-04-13 22:17:19,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442261831] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:19,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:19,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:17:19,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872652602] [2025-04-13 22:17:19,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:19,673 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:17:19,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:19,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:17:19,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:17:19,673 INFO L87 Difference]: Start difference. First operand 132 states and 439 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:19,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:19,955 INFO L93 Difference]: Finished difference Result 296 states and 1040 transitions. [2025-04-13 22:17:19,956 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:17:19,956 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:17:19,956 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:19,958 INFO L225 Difference]: With dead ends: 296 [2025-04-13 22:17:19,958 INFO L226 Difference]: Without dead ends: 290 [2025-04-13 22:17:19,958 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:17:19,959 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:19,959 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 0 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:17:19,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-04-13 22:17:19,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 134. [2025-04-13 22:17:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 3.3233082706766917) internal successors, (442), 133 states have internal predecessors, (442), 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:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 442 transitions. [2025-04-13 22:17:19,973 INFO L79 Accepts]: Start accepts. Automaton has 134 states and 442 transitions. Word has length 32 [2025-04-13 22:17:19,973 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:19,973 INFO L485 AbstractCegarLoop]: Abstraction has 134 states and 442 transitions. [2025-04-13 22:17:19,973 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:19,973 INFO L278 IsEmpty]: Start isEmpty. Operand 134 states and 442 transitions. [2025-04-13 22:17:19,975 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 22:17:19,975 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:19,975 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:19,975 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:17:19,975 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:19,977 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:19,977 INFO L85 PathProgramCache]: Analyzing trace with hash 385409688, now seen corresponding path program 7 times [2025-04-13 22:17:19,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:19,978 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246502124] [2025-04-13 22:17:19,978 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:17:19,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:19,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 22:17:20,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 22:17:20,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:20,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:17:20,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:20,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246502124] [2025-04-13 22:17:20,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246502124] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:20,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:20,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:17:20,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043032479] [2025-04-13 22:17:20,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:20,762 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:17:20,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:20,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:17:20,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:17:20,762 INFO L87 Difference]: Start difference. First operand 134 states and 442 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:21,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:21,029 INFO L93 Difference]: Finished difference Result 229 states and 749 transitions. [2025-04-13 22:17:21,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:17:21,029 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:17:21,029 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:21,031 INFO L225 Difference]: With dead ends: 229 [2025-04-13 22:17:21,031 INFO L226 Difference]: Without dead ends: 223 [2025-04-13 22:17:21,031 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:17:21,032 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:21,032 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:17:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-04-13 22:17:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 136. [2025-04-13 22:17:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 3.3407407407407406) internal successors, (451), 135 states have internal predecessors, (451), 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:21,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 451 transitions. [2025-04-13 22:17:21,042 INFO L79 Accepts]: Start accepts. Automaton has 136 states and 451 transitions. Word has length 32 [2025-04-13 22:17:21,044 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:21,044 INFO L485 AbstractCegarLoop]: Abstraction has 136 states and 451 transitions. [2025-04-13 22:17:21,044 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:21,044 INFO L278 IsEmpty]: Start isEmpty. Operand 136 states and 451 transitions. [2025-04-13 22:17:21,044 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 22:17:21,044 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:21,044 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:21,044 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 22:17:21,044 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:21,045 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:21,045 INFO L85 PathProgramCache]: Analyzing trace with hash -474059488, now seen corresponding path program 8 times [2025-04-13 22:17:21,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:21,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215219095] [2025-04-13 22:17:21,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:21,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:21,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 22:17:21,084 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 32 statements. [2025-04-13 22:17:21,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:17:21,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:17:21,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:21,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215219095] [2025-04-13 22:17:21,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215219095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:21,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:21,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:17:21,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282346415] [2025-04-13 22:17:21,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:21,656 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:17:21,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:21,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:17:21,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:17:21,657 INFO L87 Difference]: Start difference. First operand 136 states and 451 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:22,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:22,063 INFO L93 Difference]: Finished difference Result 272 states and 903 transitions. [2025-04-13 22:17:22,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:17:22,063 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:17:22,063 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:22,065 INFO L225 Difference]: With dead ends: 272 [2025-04-13 22:17:22,065 INFO L226 Difference]: Without dead ends: 266 [2025-04-13 22:17:22,065 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:17:22,066 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:22,066 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:17:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-04-13 22:17:22,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 136. [2025-04-13 22:17:22,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 3.3407407407407406) internal successors, (451), 135 states have internal predecessors, (451), 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:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 451 transitions. [2025-04-13 22:17:22,080 INFO L79 Accepts]: Start accepts. Automaton has 136 states and 451 transitions. Word has length 32 [2025-04-13 22:17:22,080 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:22,080 INFO L485 AbstractCegarLoop]: Abstraction has 136 states and 451 transitions. [2025-04-13 22:17:22,080 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:22,080 INFO L278 IsEmpty]: Start isEmpty. Operand 136 states and 451 transitions. [2025-04-13 22:17:22,081 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:17:22,081 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:22,081 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:22,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 22:17:22,081 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:22,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:22,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1826948112, now seen corresponding path program 1 times [2025-04-13 22:17:22,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:22,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233339762] [2025-04-13 22:17:22,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:17:22,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:22,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:17:22,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:17:22,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:22,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:22,217 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:17:22,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:22,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233339762] [2025-04-13 22:17:22,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233339762] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:22,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:22,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:17:22,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038842428] [2025-04-13 22:17:22,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:22,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:17:22,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:22,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:17:22,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:17:22,218 INFO L87 Difference]: Start difference. First operand 136 states and 451 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:22,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:22,302 INFO L93 Difference]: Finished difference Result 202 states and 691 transitions. [2025-04-13 22:17:22,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:17:22,302 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:17:22,302 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:22,303 INFO L225 Difference]: With dead ends: 202 [2025-04-13 22:17:22,303 INFO L226 Difference]: Without dead ends: 162 [2025-04-13 22:17:22,304 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:17:22,304 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:22,304 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:22,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-04-13 22:17:22,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-04-13 22:17:22,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 3.4161490683229814) internal successors, (550), 161 states have internal predecessors, (550), 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:22,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 550 transitions. [2025-04-13 22:17:22,317 INFO L79 Accepts]: Start accepts. Automaton has 162 states and 550 transitions. Word has length 33 [2025-04-13 22:17:22,317 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:22,317 INFO L485 AbstractCegarLoop]: Abstraction has 162 states and 550 transitions. [2025-04-13 22:17:22,317 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:22,317 INFO L278 IsEmpty]: Start isEmpty. Operand 162 states and 550 transitions. [2025-04-13 22:17:22,317 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:17:22,317 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:22,317 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:22,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 22:17:22,318 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:22,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:22,318 INFO L85 PathProgramCache]: Analyzing trace with hash -71038728, now seen corresponding path program 1 times [2025-04-13 22:17:22,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:22,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760285465] [2025-04-13 22:17:22,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:17:22,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:22,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:17:22,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:17:22,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:22,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:22,427 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:17:22,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:22,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760285465] [2025-04-13 22:17:22,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760285465] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:22,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:22,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:17:22,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909722326] [2025-04-13 22:17:22,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:22,427 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:17:22,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:22,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:17:22,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:17:22,428 INFO L87 Difference]: Start difference. First operand 162 states and 550 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:22,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:22,534 INFO L93 Difference]: Finished difference Result 222 states and 714 transitions. [2025-04-13 22:17:22,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:17:22,534 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:17:22,534 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:22,535 INFO L225 Difference]: With dead ends: 222 [2025-04-13 22:17:22,535 INFO L226 Difference]: Without dead ends: 192 [2025-04-13 22:17:22,536 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:17:22,536 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:22,536 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:22,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-04-13 22:17:22,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 165. [2025-04-13 22:17:22,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 3.3597560975609757) internal successors, (551), 164 states have internal predecessors, (551), 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:22,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 551 transitions. [2025-04-13 22:17:22,550 INFO L79 Accepts]: Start accepts. Automaton has 165 states and 551 transitions. Word has length 33 [2025-04-13 22:17:22,550 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:22,550 INFO L485 AbstractCegarLoop]: Abstraction has 165 states and 551 transitions. [2025-04-13 22:17:22,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:22,550 INFO L278 IsEmpty]: Start isEmpty. Operand 165 states and 551 transitions. [2025-04-13 22:17:22,550 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:17:22,550 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:22,551 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:22,551 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 22:17:22,551 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:22,551 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:22,551 INFO L85 PathProgramCache]: Analyzing trace with hash -559580080, now seen corresponding path program 1 times [2025-04-13 22:17:22,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:22,551 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067393887] [2025-04-13 22:17:22,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:17:22,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:22,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:17:22,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:17:22,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:22,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:22,696 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:17:22,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:22,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067393887] [2025-04-13 22:17:22,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067393887] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:22,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:22,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:17:22,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145620407] [2025-04-13 22:17:22,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:22,697 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:17:22,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:22,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:17:22,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:17:22,697 INFO L87 Difference]: Start difference. First operand 165 states and 551 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:22,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:22,903 INFO L93 Difference]: Finished difference Result 303 states and 952 transitions. [2025-04-13 22:17:22,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:17:22,904 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:17:22,904 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:22,905 INFO L225 Difference]: With dead ends: 303 [2025-04-13 22:17:22,905 INFO L226 Difference]: Without dead ends: 268 [2025-04-13 22:17:22,906 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:17:22,906 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:22,906 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:17:22,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-04-13 22:17:22,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 163. [2025-04-13 22:17:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 3.3580246913580245) internal successors, (544), 162 states have internal predecessors, (544), 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:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 544 transitions. [2025-04-13 22:17:22,924 INFO L79 Accepts]: Start accepts. Automaton has 163 states and 544 transitions. Word has length 33 [2025-04-13 22:17:22,924 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:22,924 INFO L485 AbstractCegarLoop]: Abstraction has 163 states and 544 transitions. [2025-04-13 22:17:22,925 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:22,925 INFO L278 IsEmpty]: Start isEmpty. Operand 163 states and 544 transitions. [2025-04-13 22:17:22,925 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:17:22,925 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:22,925 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:22,926 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 22:17:22,926 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 1 more)] === [2025-04-13 22:17:22,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:22,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1106332338, now seen corresponding path program 2 times [2025-04-13 22:17:22,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:22,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117130611] [2025-04-13 22:17:22,926 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:22,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:22,939 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:17:22,943 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 33 statements. [2025-04-13 22:17:22,943 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:17:22,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:23,040 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:17:23,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:23,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117130611] [2025-04-13 22:17:23,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117130611] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:23,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:23,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:17:23,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289608278] [2025-04-13 22:17:23,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:23,040 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:17:23,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:23,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:17:23,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:17:23,041 INFO L87 Difference]: Start difference. First operand 163 states and 544 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:23,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:23,159 INFO L93 Difference]: Finished difference Result 193 states and 612 transitions. [2025-04-13 22:17:23,159 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:17:23,159 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:17:23,159 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:23,160 INFO L225 Difference]: With dead ends: 193 [2025-04-13 22:17:23,160 INFO L226 Difference]: Without dead ends: 166 [2025-04-13 22:17:23,160 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:17:23,161 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:23,161 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:23,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-04-13 22:17:23,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2025-04-13 22:17:23,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 3.3529411764705883) internal successors, (513), 153 states have internal predecessors, (513), 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:23,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 513 transitions. [2025-04-13 22:17:23,175 INFO L79 Accepts]: Start accepts. Automaton has 154 states and 513 transitions. Word has length 33 [2025-04-13 22:17:23,175 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:23,175 INFO L485 AbstractCegarLoop]: Abstraction has 154 states and 513 transitions. [2025-04-13 22:17:23,175 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:23,175 INFO L278 IsEmpty]: Start isEmpty. Operand 154 states and 513 transitions. [2025-04-13 22:17:23,176 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:17:23,176 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:23,176 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:23,176 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 22:17:23,176 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 1 more)] === [2025-04-13 22:17:23,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:23,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2054741934, now seen corresponding path program 2 times [2025-04-13 22:17:23,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:23,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683933934] [2025-04-13 22:17:23,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:23,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:23,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:17:23,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 33 statements. [2025-04-13 22:17:23,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:17:23,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:23,275 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:17:23,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:23,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683933934] [2025-04-13 22:17:23,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683933934] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:23,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:23,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:17:23,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784430070] [2025-04-13 22:17:23,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:23,275 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:17:23,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:23,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:17:23,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:17:23,276 INFO L87 Difference]: Start difference. First operand 154 states and 513 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:23,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:23,413 INFO L93 Difference]: Finished difference Result 237 states and 705 transitions. [2025-04-13 22:17:23,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:17:23,413 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:17:23,413 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:23,414 INFO L225 Difference]: With dead ends: 237 [2025-04-13 22:17:23,415 INFO L226 Difference]: Without dead ends: 206 [2025-04-13 22:17:23,415 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:17:23,415 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:23,415 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:23,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-04-13 22:17:23,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 154. [2025-04-13 22:17:23,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 3.3398692810457518) internal successors, (511), 153 states have internal predecessors, (511), 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:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 511 transitions. [2025-04-13 22:17:23,427 INFO L79 Accepts]: Start accepts. Automaton has 154 states and 511 transitions. Word has length 33 [2025-04-13 22:17:23,427 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:23,427 INFO L485 AbstractCegarLoop]: Abstraction has 154 states and 511 transitions. [2025-04-13 22:17:23,427 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:23,427 INFO L278 IsEmpty]: Start isEmpty. Operand 154 states and 511 transitions. [2025-04-13 22:17:23,427 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:17:23,427 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:23,427 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:23,427 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 22:17:23,427 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 1 more)] === [2025-04-13 22:17:23,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:23,428 INFO L85 PathProgramCache]: Analyzing trace with hash 870248588, now seen corresponding path program 3 times [2025-04-13 22:17:23,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:23,428 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138626799] [2025-04-13 22:17:23,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:17:23,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:23,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:17:23,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 33 statements. [2025-04-13 22:17:23,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:17:23,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:17:23,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:23,527 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138626799] [2025-04-13 22:17:23,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138626799] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:23,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:23,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:17:23,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14215002] [2025-04-13 22:17:23,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:23,527 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:17:23,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:23,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:17:23,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:17:23,528 INFO L87 Difference]: Start difference. First operand 154 states and 511 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:23,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:23,730 INFO L93 Difference]: Finished difference Result 268 states and 825 transitions. [2025-04-13 22:17:23,730 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:17:23,730 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:17:23,730 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:23,732 INFO L225 Difference]: With dead ends: 268 [2025-04-13 22:17:23,732 INFO L226 Difference]: Without dead ends: 252 [2025-04-13 22:17:23,732 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:17:23,733 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:23,733 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:17:23,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-04-13 22:17:23,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 142. [2025-04-13 22:17:23,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 3.3333333333333335) internal successors, (470), 141 states have internal predecessors, (470), 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:23,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 470 transitions. [2025-04-13 22:17:23,747 INFO L79 Accepts]: Start accepts. Automaton has 142 states and 470 transitions. Word has length 33 [2025-04-13 22:17:23,748 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:23,748 INFO L485 AbstractCegarLoop]: Abstraction has 142 states and 470 transitions. [2025-04-13 22:17:23,748 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:23,748 INFO L278 IsEmpty]: Start isEmpty. Operand 142 states and 470 transitions. [2025-04-13 22:17:23,751 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 22:17:23,751 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:23,751 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:23,751 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 22:17:23,751 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 1 more)] === [2025-04-13 22:17:23,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:23,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1339274644, now seen corresponding path program 1 times [2025-04-13 22:17:23,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:23,752 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801779894] [2025-04-13 22:17:23,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:17:23,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:23,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-13 22:17:23,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 22:17:23,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:23,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:17:24,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:24,189 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801779894] [2025-04-13 22:17:24,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801779894] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:24,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:24,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:17:24,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617674379] [2025-04-13 22:17:24,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:24,190 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:17:24,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:24,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:17:24,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:17:24,191 INFO L87 Difference]: Start difference. First operand 142 states and 470 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:24,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:24,399 INFO L93 Difference]: Finished difference Result 247 states and 815 transitions. [2025-04-13 22:17:24,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:17:24,399 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 22:17:24,399 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:24,400 INFO L225 Difference]: With dead ends: 247 [2025-04-13 22:17:24,401 INFO L226 Difference]: Without dead ends: 237 [2025-04-13 22:17:24,401 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:17:24,401 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:24,401 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:17:24,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-04-13 22:17:24,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 156. [2025-04-13 22:17:24,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 3.232258064516129) internal successors, (501), 155 states have internal predecessors, (501), 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:24,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 501 transitions. [2025-04-13 22:17:24,417 INFO L79 Accepts]: Start accepts. Automaton has 156 states and 501 transitions. Word has length 34 [2025-04-13 22:17:24,417 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:24,417 INFO L485 AbstractCegarLoop]: Abstraction has 156 states and 501 transitions. [2025-04-13 22:17:24,417 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:24,417 INFO L278 IsEmpty]: Start isEmpty. Operand 156 states and 501 transitions. [2025-04-13 22:17:24,418 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 22:17:24,418 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:24,418 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:24,418 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 22:17:24,418 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 1 more)] === [2025-04-13 22:17:24,418 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:24,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1267675892, now seen corresponding path program 2 times [2025-04-13 22:17:24,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:24,419 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951286655] [2025-04-13 22:17:24,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:24,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:24,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-13 22:17:24,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 34 statements. [2025-04-13 22:17:24,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:17:24,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:17:24,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:24,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951286655] [2025-04-13 22:17:24,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951286655] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:24,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:24,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:17:24,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276307206] [2025-04-13 22:17:24,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:24,582 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:17:24,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:24,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:17:24,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:17:24,582 INFO L87 Difference]: Start difference. First operand 156 states and 501 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:24,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:24,751 INFO L93 Difference]: Finished difference Result 206 states and 612 transitions. [2025-04-13 22:17:24,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:17:24,753 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 22:17:24,753 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:24,754 INFO L225 Difference]: With dead ends: 206 [2025-04-13 22:17:24,754 INFO L226 Difference]: Without dead ends: 173 [2025-04-13 22:17:24,754 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:17:24,754 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:24,755 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:24,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-04-13 22:17:24,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 156. [2025-04-13 22:17:24,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 3.1870967741935483) internal successors, (494), 155 states have internal predecessors, (494), 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:24,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 494 transitions. [2025-04-13 22:17:24,773 INFO L79 Accepts]: Start accepts. Automaton has 156 states and 494 transitions. Word has length 34 [2025-04-13 22:17:24,773 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:24,773 INFO L485 AbstractCegarLoop]: Abstraction has 156 states and 494 transitions. [2025-04-13 22:17:24,773 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:24,773 INFO L278 IsEmpty]: Start isEmpty. Operand 156 states and 494 transitions. [2025-04-13 22:17:24,773 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 22:17:24,773 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:24,773 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:24,773 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 22:17:24,773 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 1 more)] === [2025-04-13 22:17:24,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:24,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1677392096, now seen corresponding path program 3 times [2025-04-13 22:17:24,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:24,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642449150] [2025-04-13 22:17:24,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:17:24,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:24,790 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 4 equivalence classes. [2025-04-13 22:17:24,807 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 34 statements. [2025-04-13 22:17:24,807 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:17:24,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:24,930 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:17:24,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:24,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642449150] [2025-04-13 22:17:24,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642449150] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:24,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:24,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:17:24,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783611988] [2025-04-13 22:17:24,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:24,931 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:17:24,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:24,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:17:24,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:17:24,931 INFO L87 Difference]: Start difference. First operand 156 states and 494 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:25,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:25,087 INFO L93 Difference]: Finished difference Result 237 states and 676 transitions. [2025-04-13 22:17:25,088 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:17:25,088 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 22:17:25,088 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:25,089 INFO L225 Difference]: With dead ends: 237 [2025-04-13 22:17:25,089 INFO L226 Difference]: Without dead ends: 196 [2025-04-13 22:17:25,089 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:17:25,090 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:25,090 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:25,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-04-13 22:17:25,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 156. [2025-04-13 22:17:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 3.161290322580645) internal successors, (490), 155 states have internal predecessors, (490), 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:25,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 490 transitions. [2025-04-13 22:17:25,105 INFO L79 Accepts]: Start accepts. Automaton has 156 states and 490 transitions. Word has length 34 [2025-04-13 22:17:25,105 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:25,105 INFO L485 AbstractCegarLoop]: Abstraction has 156 states and 490 transitions. [2025-04-13 22:17:25,105 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:25,105 INFO L278 IsEmpty]: Start isEmpty. Operand 156 states and 490 transitions. [2025-04-13 22:17:25,106 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 22:17:25,106 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:25,106 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:25,106 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 22:17:25,106 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 1 more)] === [2025-04-13 22:17:25,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:25,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1982224232, now seen corresponding path program 4 times [2025-04-13 22:17:25,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:25,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530462064] [2025-04-13 22:17:25,106 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:17:25,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:25,138 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-13 22:17:25,181 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 22:17:25,181 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:17:25,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:25,456 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:17:25,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:25,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530462064] [2025-04-13 22:17:25,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530462064] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:25,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:25,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:17:25,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005343869] [2025-04-13 22:17:25,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:25,456 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:17:25,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:25,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:17:25,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:17:25,457 INFO L87 Difference]: Start difference. First operand 156 states and 490 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:25,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:25,634 INFO L93 Difference]: Finished difference Result 250 states and 803 transitions. [2025-04-13 22:17:25,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:17:25,634 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 22:17:25,634 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:25,636 INFO L225 Difference]: With dead ends: 250 [2025-04-13 22:17:25,636 INFO L226 Difference]: Without dead ends: 234 [2025-04-13 22:17:25,636 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:17:25,636 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:25,636 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:25,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-04-13 22:17:25,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 152. [2025-04-13 22:17:25,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 3.185430463576159) internal successors, (481), 151 states have internal predecessors, (481), 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:25,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 481 transitions. [2025-04-13 22:17:25,654 INFO L79 Accepts]: Start accepts. Automaton has 152 states and 481 transitions. Word has length 34 [2025-04-13 22:17:25,654 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:25,654 INFO L485 AbstractCegarLoop]: Abstraction has 152 states and 481 transitions. [2025-04-13 22:17:25,654 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:25,654 INFO L278 IsEmpty]: Start isEmpty. Operand 152 states and 481 transitions. [2025-04-13 22:17:25,655 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 22:17:25,655 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:25,655 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:25,655 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 22:17:25,655 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 1 more)] === [2025-04-13 22:17:25,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:25,656 INFO L85 PathProgramCache]: Analyzing trace with hash 830724440, now seen corresponding path program 5 times [2025-04-13 22:17:25,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:25,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829228215] [2025-04-13 22:17:25,656 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:17:25,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:25,674 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 4 equivalence classes. [2025-04-13 22:17:25,831 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 22:17:25,831 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:17:25,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-04-13 22:17:26,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:26,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829228215] [2025-04-13 22:17:26,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829228215] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:26,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78371516] [2025-04-13 22:17:26,161 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:17:26,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:26,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:26,163 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:17:26,164 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:17:26,363 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 4 equivalence classes. [2025-04-13 22:17:26,549 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-04-13 22:17:26,549 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:17:26,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:26,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 22:17:26,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:17:26,675 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:17:26,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78371516] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:26,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:17:26,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-04-13 22:17:26,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610166309] [2025-04-13 22:17:26,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:26,675 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:17:26,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:26,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:17:26,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:17:26,676 INFO L87 Difference]: Start difference. First operand 152 states and 481 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:26,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:26,868 INFO L93 Difference]: Finished difference Result 213 states and 619 transitions. [2025-04-13 22:17:26,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:17:26,869 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 22:17:26,869 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:26,870 INFO L225 Difference]: With dead ends: 213 [2025-04-13 22:17:26,870 INFO L226 Difference]: Without dead ends: 203 [2025-04-13 22:17:26,870 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:17:26,872 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 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:17:26,872 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:26,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-04-13 22:17:26,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 161. [2025-04-13 22:17:26,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 3.15625) internal successors, (505), 160 states have internal predecessors, (505), 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:26,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 505 transitions. [2025-04-13 22:17:26,890 INFO L79 Accepts]: Start accepts. Automaton has 161 states and 505 transitions. Word has length 34 [2025-04-13 22:17:26,890 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:26,890 INFO L485 AbstractCegarLoop]: Abstraction has 161 states and 505 transitions. [2025-04-13 22:17:26,890 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:26,890 INFO L278 IsEmpty]: Start isEmpty. Operand 161 states and 505 transitions. [2025-04-13 22:17:26,891 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-04-13 22:17:26,891 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:26,891 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:26,899 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:17:27,091 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:27,092 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:27,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:27,092 INFO L85 PathProgramCache]: Analyzing trace with hash 247971360, now seen corresponding path program 6 times [2025-04-13 22:17:27,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:27,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424279219] [2025-04-13 22:17:27,092 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:17:27,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:27,106 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 4 equivalence classes. [2025-04-13 22:17:27,125 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 18 of 34 statements. [2025-04-13 22:17:27,125 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:17:27,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:17:27,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:27,254 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424279219] [2025-04-13 22:17:27,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424279219] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:27,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:27,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:17:27,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429289097] [2025-04-13 22:17:27,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:27,254 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:17:27,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:27,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:17:27,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:17:27,255 INFO L87 Difference]: Start difference. First operand 161 states and 505 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:27,435 INFO L93 Difference]: Finished difference Result 210 states and 623 transitions. [2025-04-13 22:17:27,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:17:27,435 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-04-13 22:17:27,435 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:27,437 INFO L225 Difference]: With dead ends: 210 [2025-04-13 22:17:27,437 INFO L226 Difference]: Without dead ends: 198 [2025-04-13 22:17:27,437 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:17:27,438 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:27,438 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:27,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-04-13 22:17:27,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 161. [2025-04-13 22:17:27,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 3.14375) internal successors, (503), 160 states have internal predecessors, (503), 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:27,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 503 transitions. [2025-04-13 22:17:27,456 INFO L79 Accepts]: Start accepts. Automaton has 161 states and 503 transitions. Word has length 34 [2025-04-13 22:17:27,456 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:27,456 INFO L485 AbstractCegarLoop]: Abstraction has 161 states and 503 transitions. [2025-04-13 22:17:27,456 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:27,456 INFO L278 IsEmpty]: Start isEmpty. Operand 161 states and 503 transitions. [2025-04-13 22:17:27,458 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:17:27,458 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:27,458 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:27,458 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 22:17:27,458 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:27,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:27,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1831125640, now seen corresponding path program 1 times [2025-04-13 22:17:27,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:27,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421203242] [2025-04-13 22:17:27,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:17:27,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:27,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 22:17:27,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:17:27,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:27,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:17:27,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:27,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421203242] [2025-04-13 22:17:27,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421203242] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:27,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:27,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:17:27,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043141240] [2025-04-13 22:17:27,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:27,551 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:17:27,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:27,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:17:27,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:17:27,551 INFO L87 Difference]: Start difference. First operand 161 states and 503 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:27,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:27,663 INFO L93 Difference]: Finished difference Result 226 states and 688 transitions. [2025-04-13 22:17:27,663 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:17:27,663 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:17:27,663 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:27,664 INFO L225 Difference]: With dead ends: 226 [2025-04-13 22:17:27,664 INFO L226 Difference]: Without dead ends: 209 [2025-04-13 22:17:27,666 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:17:27,666 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:27,667 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:27,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-04-13 22:17:27,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 174. [2025-04-13 22:17:27,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 3.2254335260115607) internal successors, (558), 173 states have internal predecessors, (558), 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:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 558 transitions. [2025-04-13 22:17:27,686 INFO L79 Accepts]: Start accepts. Automaton has 174 states and 558 transitions. Word has length 35 [2025-04-13 22:17:27,686 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:27,687 INFO L485 AbstractCegarLoop]: Abstraction has 174 states and 558 transitions. [2025-04-13 22:17:27,687 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:27,687 INFO L278 IsEmpty]: Start isEmpty. Operand 174 states and 558 transitions. [2025-04-13 22:17:27,687 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:17:27,687 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:27,687 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:27,687 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 22:17:27,687 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:27,687 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:27,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1975300304, now seen corresponding path program 1 times [2025-04-13 22:17:27,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:27,688 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070332686] [2025-04-13 22:17:27,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:17:27,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:27,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 22:17:27,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:17:27,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:27,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:17:27,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:27,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070332686] [2025-04-13 22:17:27,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070332686] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:27,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:27,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:17:27,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053290055] [2025-04-13 22:17:27,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:27,773 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:17:27,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:27,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:17:27,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:17:27,774 INFO L87 Difference]: Start difference. First operand 174 states and 558 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:27,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:27,890 INFO L93 Difference]: Finished difference Result 228 states and 679 transitions. [2025-04-13 22:17:27,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:17:27,890 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:17:27,890 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:27,892 INFO L225 Difference]: With dead ends: 228 [2025-04-13 22:17:27,892 INFO L226 Difference]: Without dead ends: 196 [2025-04-13 22:17:27,892 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:17:27,892 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:27,893 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:27,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-04-13 22:17:27,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 174. [2025-04-13 22:17:27,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 3.1502890173410405) internal successors, (545), 173 states have internal predecessors, (545), 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:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 545 transitions. [2025-04-13 22:17:27,912 INFO L79 Accepts]: Start accepts. Automaton has 174 states and 545 transitions. Word has length 35 [2025-04-13 22:17:27,912 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:27,912 INFO L485 AbstractCegarLoop]: Abstraction has 174 states and 545 transitions. [2025-04-13 22:17:27,912 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:27,912 INFO L278 IsEmpty]: Start isEmpty. Operand 174 states and 545 transitions. [2025-04-13 22:17:27,913 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:17:27,913 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:27,913 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:27,913 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 22:17:27,913 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:27,913 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:27,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1908905658, now seen corresponding path program 2 times [2025-04-13 22:17:27,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:27,913 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300991480] [2025-04-13 22:17:27,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:27,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:27,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:17:27,932 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 35 statements. [2025-04-13 22:17:27,932 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:17:27,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:27,975 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:17:27,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:27,975 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300991480] [2025-04-13 22:17:27,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300991480] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:27,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:27,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:17:27,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230103905] [2025-04-13 22:17:27,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:27,976 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:17:27,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:27,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:17:27,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:17:27,977 INFO L87 Difference]: Start difference. First operand 174 states and 545 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:28,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:28,119 INFO L93 Difference]: Finished difference Result 228 states and 697 transitions. [2025-04-13 22:17:28,120 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:17:28,120 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:17:28,120 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:28,122 INFO L225 Difference]: With dead ends: 228 [2025-04-13 22:17:28,122 INFO L226 Difference]: Without dead ends: 210 [2025-04-13 22:17:28,122 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:17:28,123 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:28,123 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:28,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-04-13 22:17:28,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 181. [2025-04-13 22:17:28,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 3.2) internal successors, (576), 180 states have internal predecessors, (576), 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:28,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 576 transitions. [2025-04-13 22:17:28,152 INFO L79 Accepts]: Start accepts. Automaton has 181 states and 576 transitions. Word has length 35 [2025-04-13 22:17:28,152 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:28,153 INFO L485 AbstractCegarLoop]: Abstraction has 181 states and 576 transitions. [2025-04-13 22:17:28,153 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:28,153 INFO L278 IsEmpty]: Start isEmpty. Operand 181 states and 576 transitions. [2025-04-13 22:17:28,153 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:17:28,153 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:28,153 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:28,153 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 22:17:28,154 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:28,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:28,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1499916046, now seen corresponding path program 2 times [2025-04-13 22:17:28,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:28,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128288373] [2025-04-13 22:17:28,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:28,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:28,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:17:28,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 35 statements. [2025-04-13 22:17:28,178 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:17:28,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:28,238 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:17:28,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:28,238 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128288373] [2025-04-13 22:17:28,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128288373] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:28,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:28,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:17:28,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891597879] [2025-04-13 22:17:28,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:28,239 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:17:28,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:28,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:17:28,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:17:28,239 INFO L87 Difference]: Start difference. First operand 181 states and 576 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:28,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:28,365 INFO L93 Difference]: Finished difference Result 226 states and 677 transitions. [2025-04-13 22:17:28,366 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:17:28,366 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:17:28,366 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:28,368 INFO L225 Difference]: With dead ends: 226 [2025-04-13 22:17:28,368 INFO L226 Difference]: Without dead ends: 209 [2025-04-13 22:17:28,368 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:17:28,368 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:28,369 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:28,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-04-13 22:17:28,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 154. [2025-04-13 22:17:28,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 3.104575163398693) internal successors, (475), 153 states have internal predecessors, (475), 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:28,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 475 transitions. [2025-04-13 22:17:28,395 INFO L79 Accepts]: Start accepts. Automaton has 154 states and 475 transitions. Word has length 35 [2025-04-13 22:17:28,395 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:28,395 INFO L485 AbstractCegarLoop]: Abstraction has 154 states and 475 transitions. [2025-04-13 22:17:28,395 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:28,395 INFO L278 IsEmpty]: Start isEmpty. Operand 154 states and 475 transitions. [2025-04-13 22:17:28,395 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:17:28,395 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:28,395 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:28,396 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 22:17:28,396 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:28,396 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:28,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1025533714, now seen corresponding path program 3 times [2025-04-13 22:17:28,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:28,396 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307889387] [2025-04-13 22:17:28,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:17:28,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:28,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 4 equivalence classes. [2025-04-13 22:17:28,419 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 35 statements. [2025-04-13 22:17:28,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:17:28,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:28,463 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:17:28,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:28,463 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307889387] [2025-04-13 22:17:28,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307889387] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:28,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:28,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:17:28,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561563294] [2025-04-13 22:17:28,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:28,464 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:17:28,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:28,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:17:28,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:17:28,465 INFO L87 Difference]: Start difference. First operand 154 states and 475 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:28,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:28,622 INFO L93 Difference]: Finished difference Result 182 states and 539 transitions. [2025-04-13 22:17:28,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:17:28,622 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:17:28,622 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:28,624 INFO L225 Difference]: With dead ends: 182 [2025-04-13 22:17:28,624 INFO L226 Difference]: Without dead ends: 161 [2025-04-13 22:17:28,624 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:17:28,625 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:28,625 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:28,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-04-13 22:17:28,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 154. [2025-04-13 22:17:28,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 3.0784313725490198) internal successors, (471), 153 states have internal predecessors, (471), 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:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 471 transitions. [2025-04-13 22:17:28,650 INFO L79 Accepts]: Start accepts. Automaton has 154 states and 471 transitions. Word has length 35 [2025-04-13 22:17:28,650 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:28,650 INFO L485 AbstractCegarLoop]: Abstraction has 154 states and 471 transitions. [2025-04-13 22:17:28,650 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:28,651 INFO L278 IsEmpty]: Start isEmpty. Operand 154 states and 471 transitions. [2025-04-13 22:17:28,651 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:17:28,651 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:28,651 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:28,651 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 22:17:28,651 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:28,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:28,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1779600908, now seen corresponding path program 3 times [2025-04-13 22:17:28,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:28,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775121925] [2025-04-13 22:17:28,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:17:28,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:28,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 4 equivalence classes. [2025-04-13 22:17:28,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 35 statements. [2025-04-13 22:17:28,677 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:17:28,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:28,727 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:17:28,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:28,727 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775121925] [2025-04-13 22:17:28,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775121925] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:28,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:28,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:17:28,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509782283] [2025-04-13 22:17:28,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:28,728 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:17:28,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:28,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:17:28,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:17:28,728 INFO L87 Difference]: Start difference. First operand 154 states and 471 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:28,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:28,839 INFO L93 Difference]: Finished difference Result 183 states and 538 transitions. [2025-04-13 22:17:28,839 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:17:28,839 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:17:28,839 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:28,841 INFO L225 Difference]: With dead ends: 183 [2025-04-13 22:17:28,841 INFO L226 Difference]: Without dead ends: 165 [2025-04-13 22:17:28,841 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:17:28,841 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:28,841 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:28,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-04-13 22:17:28,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 140. [2025-04-13 22:17:28,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.9424460431654675) internal successors, (409), 139 states have internal predecessors, (409), 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:28,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 409 transitions. [2025-04-13 22:17:28,857 INFO L79 Accepts]: Start accepts. Automaton has 140 states and 409 transitions. Word has length 35 [2025-04-13 22:17:28,857 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:28,857 INFO L485 AbstractCegarLoop]: Abstraction has 140 states and 409 transitions. [2025-04-13 22:17:28,857 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:28,857 INFO L278 IsEmpty]: Start isEmpty. Operand 140 states and 409 transitions. [2025-04-13 22:17:28,858 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:17:28,858 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:28,858 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:28,858 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 22:17:28,858 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:28,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:28,858 INFO L85 PathProgramCache]: Analyzing trace with hash 894124612, now seen corresponding path program 4 times [2025-04-13 22:17:28,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:28,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683054014] [2025-04-13 22:17:28,859 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:17:28,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:28,872 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:17:28,881 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:17:28,882 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:17:28,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:28,941 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:17:28,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:28,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683054014] [2025-04-13 22:17:28,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683054014] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:28,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:28,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:17:28,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407664152] [2025-04-13 22:17:28,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:28,941 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:17:28,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:28,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:17:28,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:17:28,942 INFO L87 Difference]: Start difference. First operand 140 states and 409 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:29,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:29,050 INFO L93 Difference]: Finished difference Result 169 states and 476 transitions. [2025-04-13 22:17:29,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:17:29,050 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:17:29,051 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:29,052 INFO L225 Difference]: With dead ends: 169 [2025-04-13 22:17:29,052 INFO L226 Difference]: Without dead ends: 147 [2025-04-13 22:17:29,052 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:17:29,052 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:29,052 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:29,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-04-13 22:17:29,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 138. [2025-04-13 22:17:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.9197080291970803) internal successors, (400), 137 states have internal predecessors, (400), 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:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 400 transitions. [2025-04-13 22:17:29,075 INFO L79 Accepts]: Start accepts. Automaton has 138 states and 400 transitions. Word has length 35 [2025-04-13 22:17:29,075 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:29,076 INFO L485 AbstractCegarLoop]: Abstraction has 138 states and 400 transitions. [2025-04-13 22:17:29,076 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:29,076 INFO L278 IsEmpty]: Start isEmpty. Operand 138 states and 400 transitions. [2025-04-13 22:17:29,076 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:17:29,076 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:29,076 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:29,076 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 22:17:29,077 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:29,077 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:29,077 INFO L85 PathProgramCache]: Analyzing trace with hash -556649236, now seen corresponding path program 4 times [2025-04-13 22:17:29,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:29,077 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377382433] [2025-04-13 22:17:29,077 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:17:29,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:29,094 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-13 22:17:29,103 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:17:29,103 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:17:29,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:17:29,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:29,172 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377382433] [2025-04-13 22:17:29,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377382433] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:29,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:29,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:17:29,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949093979] [2025-04-13 22:17:29,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:29,172 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:17:29,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:29,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:17:29,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:17:29,173 INFO L87 Difference]: Start difference. First operand 138 states and 400 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:29,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:29,286 INFO L93 Difference]: Finished difference Result 185 states and 506 transitions. [2025-04-13 22:17:29,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:17:29,286 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:17:29,287 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:29,288 INFO L225 Difference]: With dead ends: 185 [2025-04-13 22:17:29,288 INFO L226 Difference]: Without dead ends: 161 [2025-04-13 22:17:29,288 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:17:29,291 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:29,291 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:29,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-04-13 22:17:29,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 140. [2025-04-13 22:17:29,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.8992805755395685) internal successors, (403), 139 states have internal predecessors, (403), 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:29,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 403 transitions. [2025-04-13 22:17:29,307 INFO L79 Accepts]: Start accepts. Automaton has 140 states and 403 transitions. Word has length 35 [2025-04-13 22:17:29,307 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:29,307 INFO L485 AbstractCegarLoop]: Abstraction has 140 states and 403 transitions. [2025-04-13 22:17:29,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:29,307 INFO L278 IsEmpty]: Start isEmpty. Operand 140 states and 403 transitions. [2025-04-13 22:17:29,307 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:17:29,307 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:29,307 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:29,307 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 22:17:29,307 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:29,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:29,308 INFO L85 PathProgramCache]: Analyzing trace with hash -358108346, now seen corresponding path program 5 times [2025-04-13 22:17:29,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:29,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715699694] [2025-04-13 22:17:29,308 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:17:29,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:29,322 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 4 equivalence classes. [2025-04-13 22:17:29,338 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:17:29,339 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:17:29,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:29,399 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:17:29,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:29,400 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715699694] [2025-04-13 22:17:29,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715699694] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:29,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:29,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:17:29,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101877351] [2025-04-13 22:17:29,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:29,401 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:17:29,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:29,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:17:29,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:17:29,401 INFO L87 Difference]: Start difference. First operand 140 states and 403 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:29,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:29,475 INFO L93 Difference]: Finished difference Result 161 states and 450 transitions. [2025-04-13 22:17:29,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:17:29,475 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:17:29,475 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:29,476 INFO L225 Difference]: With dead ends: 161 [2025-04-13 22:17:29,476 INFO L226 Difference]: Without dead ends: 138 [2025-04-13 22:17:29,477 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:17:29,477 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:29,477 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 0 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:29,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-04-13 22:17:29,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-04-13 22:17:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.9051094890510947) internal successors, (398), 137 states have internal predecessors, (398), 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:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 398 transitions. [2025-04-13 22:17:29,491 INFO L79 Accepts]: Start accepts. Automaton has 138 states and 398 transitions. Word has length 35 [2025-04-13 22:17:29,492 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:29,492 INFO L485 AbstractCegarLoop]: Abstraction has 138 states and 398 transitions. [2025-04-13 22:17:29,492 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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:29,492 INFO L278 IsEmpty]: Start isEmpty. Operand 138 states and 398 transitions. [2025-04-13 22:17:29,492 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:17:29,492 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:29,492 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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:17:29,492 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 22:17:29,492 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:29,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:29,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1817827988, now seen corresponding path program 1 times [2025-04-13 22:17:29,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:29,493 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919953774] [2025-04-13 22:17:29,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:17:29,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:29,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 22:17:29,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:17:29,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:29,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:29,592 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-13 22:17:29,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:29,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919953774] [2025-04-13 22:17:29,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919953774] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:29,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:29,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:17:29,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69195654] [2025-04-13 22:17:29,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:29,593 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:17:29,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:29,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:17:29,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:17:29,593 INFO L87 Difference]: Start difference. First operand 138 states and 398 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:29,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:29,672 INFO L93 Difference]: Finished difference Result 213 states and 640 transitions. [2025-04-13 22:17:29,672 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:17:29,672 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 36 [2025-04-13 22:17:29,672 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:29,673 INFO L225 Difference]: With dead ends: 213 [2025-04-13 22:17:29,673 INFO L226 Difference]: Without dead ends: 173 [2025-04-13 22:17:29,674 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:17:29,674 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:29,674 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:29,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-04-13 22:17:29,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-04-13 22:17:29,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 2.994186046511628) internal successors, (515), 172 states have internal predecessors, (515), 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:29,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 515 transitions. [2025-04-13 22:17:29,696 INFO L79 Accepts]: Start accepts. Automaton has 173 states and 515 transitions. Word has length 36 [2025-04-13 22:17:29,696 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:29,696 INFO L485 AbstractCegarLoop]: Abstraction has 173 states and 515 transitions. [2025-04-13 22:17:29,696 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:29,696 INFO L278 IsEmpty]: Start isEmpty. Operand 173 states and 515 transitions. [2025-04-13 22:17:29,698 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:17:29,698 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:29,698 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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:17:29,698 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 22:17:29,698 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:29,698 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:29,698 INFO L85 PathProgramCache]: Analyzing trace with hash 854279248, now seen corresponding path program 1 times [2025-04-13 22:17:29,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:29,698 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164382687] [2025-04-13 22:17:29,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:17:29,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:29,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 22:17:29,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:17:29,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:29,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-04-13 22:17:29,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:29,815 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164382687] [2025-04-13 22:17:29,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164382687] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:17:29,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:17:29,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:17:29,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996785658] [2025-04-13 22:17:29,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:17:29,816 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:17:29,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:29,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:17:29,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:17:29,817 INFO L87 Difference]: Start difference. First operand 173 states and 515 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:29,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:29,912 INFO L93 Difference]: Finished difference Result 249 states and 769 transitions. [2025-04-13 22:17:29,912 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:17:29,912 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 37 [2025-04-13 22:17:29,912 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:29,913 INFO L225 Difference]: With dead ends: 249 [2025-04-13 22:17:29,914 INFO L226 Difference]: Without dead ends: 210 [2025-04-13 22:17:29,915 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:17:29,916 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:29,916 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 0 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:29,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-04-13 22:17:29,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2025-04-13 22:17:29,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 3.0669856459330145) internal successors, (641), 209 states have internal predecessors, (641), 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:29,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 641 transitions. [2025-04-13 22:17:29,960 INFO L79 Accepts]: Start accepts. Automaton has 210 states and 641 transitions. Word has length 37 [2025-04-13 22:17:29,960 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:29,960 INFO L485 AbstractCegarLoop]: Abstraction has 210 states and 641 transitions. [2025-04-13 22:17:29,960 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:29,960 INFO L278 IsEmpty]: Start isEmpty. Operand 210 states and 641 transitions. [2025-04-13 22:17:29,961 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 22:17:29,961 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:29,961 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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:17:29,961 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 22:17:29,961 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:17:29,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:29,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1284809528, now seen corresponding path program 1 times [2025-04-13 22:17:29,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:29,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047739060] [2025-04-13 22:17:29,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:17:29,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:29,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 22:17:30,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 22:17:30,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:30,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:39,101 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:17:39,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:39,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047739060] [2025-04-13 22:17:39,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047739060] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:39,102 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387474421] [2025-04-13 22:17:39,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:17:39,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:39,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:39,103 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:17:39,105 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:17:39,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 22:17:39,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 22:17:39,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:39,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:39,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 22:17:39,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:41,183 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:17:41,184 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 320 treesize of output 328 [2025-04-13 22:17:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:17:41,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:46,779 INFO L325 Elim1Store]: treesize reduction 13, result has 98.3 percent of original size [2025-04-13 22:17:46,779 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 432 treesize of output 1061 [2025-04-13 22:18:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 22:18:20,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387474421] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:20,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:20,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 10, 10] total 47 [2025-04-13 22:18:20,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118570154] [2025-04-13 22:18:20,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:20,297 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-13 22:18:20,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:20,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-13 22:18:20,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2109, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:18:20,298 INFO L87 Difference]: Start difference. First operand 210 states and 641 transitions. Second operand has 48 states, 47 states have (on average 1.7446808510638299) internal successors, (82), 48 states have internal predecessors, (82), 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:27,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:27,440 INFO L93 Difference]: Finished difference Result 642 states and 2102 transitions. [2025-04-13 22:18:27,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-04-13 22:18:27,440 INFO L79 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.7446808510638299) internal successors, (82), 48 states have internal predecessors, (82), 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 38 [2025-04-13 22:18:27,440 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:27,444 INFO L225 Difference]: With dead ends: 642 [2025-04-13 22:18:27,444 INFO L226 Difference]: Without dead ends: 631 [2025-04-13 22:18:27,445 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=738, Invalid=6744, Unknown=0, NotChecked=0, Total=7482 [2025-04-13 22:18:27,446 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 429 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3218 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 3218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:27,446 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 0 Invalid, 3300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 3218 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-04-13 22:18:27,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-04-13 22:18:27,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 271. [2025-04-13 22:18:27,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 3.140740740740741) internal successors, (848), 270 states have internal predecessors, (848), 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:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 848 transitions. [2025-04-13 22:18:27,514 INFO L79 Accepts]: Start accepts. Automaton has 271 states and 848 transitions. Word has length 38 [2025-04-13 22:18:27,514 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:27,514 INFO L485 AbstractCegarLoop]: Abstraction has 271 states and 848 transitions. [2025-04-13 22:18:27,515 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.7446808510638299) internal successors, (82), 48 states have internal predecessors, (82), 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:27,515 INFO L278 IsEmpty]: Start isEmpty. Operand 271 states and 848 transitions. [2025-04-13 22:18:27,515 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 22:18:27,515 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:27,515 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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:27,525 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:18:27,716 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,SelfDestructingSolverStorable32 [2025-04-13 22:18:27,716 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:18:27,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:27,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1152983306, now seen corresponding path program 2 times [2025-04-13 22:18:27,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:27,717 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130734039] [2025-04-13 22:18:27,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:18:27,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:27,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 22:18:27,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 22:18:27,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:18:27,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:18:35,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:35,629 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130734039] [2025-04-13 22:18:35,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130734039] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:35,629 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344441771] [2025-04-13 22:18:35,629 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:18:35,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:35,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:35,632 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:18:35,632 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:18:35,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-13 22:18:35,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 22:18:35,906 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:18:35,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:35,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 133 conjuncts are in the unsatisfiable core [2025-04-13 22:18:35,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:35,926 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 22:18:35,935 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2025-04-13 22:18:35,938 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-13 22:18:35,945 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-13 22:18:35,954 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 42 [2025-04-13 22:18:35,956 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 60 [2025-04-13 22:18:35,963 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2025-04-13 22:18:36,014 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 66 [2025-04-13 22:18:36,017 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 86 [2025-04-13 22:18:36,026 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2025-04-13 22:18:36,106 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 77 [2025-04-13 22:18:36,185 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 114 [2025-04-13 22:18:36,188 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 128 [2025-04-13 22:18:36,196 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 87 [2025-04-13 22:18:36,357 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-13 22:18:36,357 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-13 22:18:36,516 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 185 [2025-04-13 22:18:36,614 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 185 [2025-04-13 22:18:36,716 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 185 [2025-04-13 22:18:36,815 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 185 [2025-04-13 22:18:36,926 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 185 [2025-04-13 22:18:37,067 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:18:37,067 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 22:18:37,202 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 185 [2025-04-13 22:18:37,379 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 185 [2025-04-13 22:18:37,572 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 185 [2025-04-13 22:18:37,763 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 185 [2025-04-13 22:18:37,966 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 185 [2025-04-13 22:18:53,395 WARN L286 SmtUtils]: Spent 9.55s on a formula simplification that was a NOOP. DAG size: 1417 (called from [L 323] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-04-13 22:18:53,396 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:53,397 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 66 select indices, 66 select index equivalence classes, 6 disjoint index pairs (out of 2145 index pairs), introduced 66 new quantified variables, introduced 2145 case distinctions, treesize of input 1366 treesize of output 5014 [2025-04-13 22:24:00,486 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 22:24:00,487 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 22:24:00,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-04-13 22:24:00,495 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:24:00,687 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:00,688 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:583) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 60 more [2025-04-13 22:24:00,691 INFO L158 Benchmark]: Toolchain (without parser) took 412219.23ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 906.0MB). Free memory was 100.1MB in the beginning and 509.7MB in the end (delta: -409.7MB). Peak memory consumption was 682.4MB. Max. memory is 8.0GB. [2025-04-13 22:24:00,691 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:24:00,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.30ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 81.4MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 22:24:00,691 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.82ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 77.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:24:00,691 INFO L158 Benchmark]: Boogie Preprocessor took 55.37ms. Allocated memory is still 142.6MB. Free memory was 77.3MB in the beginning and 73.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:24:00,691 INFO L158 Benchmark]: IcfgBuilder took 1559.48ms. Allocated memory was 142.6MB in the beginning and 348.1MB in the end (delta: 205.5MB). Free memory was 73.1MB in the beginning and 292.8MB in the end (delta: -219.7MB). Peak memory consumption was 66.4MB. Max. memory is 8.0GB. [2025-04-13 22:24:00,691 INFO L158 Benchmark]: TraceAbstraction took 410252.29ms. Allocated memory was 348.1MB in the beginning and 1.0GB in the end (delta: 700.4MB). Free memory was 292.8MB in the beginning and 509.7MB in the end (delta: -217.0MB). Peak memory consumption was 670.6MB. Max. memory is 8.0GB. [2025-04-13 22:24:00,692 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 304.30ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 81.4MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.82ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 77.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.37ms. Allocated memory is still 142.6MB. Free memory was 77.3MB in the beginning and 73.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 1559.48ms. Allocated memory was 142.6MB in the beginning and 348.1MB in the end (delta: 205.5MB). Free memory was 73.1MB in the beginning and 292.8MB in the end (delta: -219.7MB). Peak memory consumption was 66.4MB. Max. memory is 8.0GB. * TraceAbstraction took 410252.29ms. Allocated memory was 348.1MB in the beginning and 1.0GB in the end (delta: 700.4MB). Free memory was 292.8MB in the beginning and 509.7MB in the end (delta: -217.0MB). Peak memory consumption was 670.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...