/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-time-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:25:01,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:25:01,396 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:25:01,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:25:01,399 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:25:01,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:25:01,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:25:01,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:25:01,422 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:25:01,422 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:25:01,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:25:01,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:25:01,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:25:01,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:25:01,424 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:25:01,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:25:01,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:25:01,424 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:25:01,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:25:01,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:25:01,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:25:01,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:25:01,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:25:01,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:25:01,424 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:25:01,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:25:01,424 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:25:01,424 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:25:01,425 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:25:01,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:25:01,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:25:01,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:25:01,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:25:01,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:25:01,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:25:01,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:25:01,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:25:01,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:25:01,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:25:01,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:25:01,425 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:25:01,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:25:01,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:25:01,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:25:01,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:25:01,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:25:01,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:25:01,426 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:25:01,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:25:01,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:25:01,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:25:01,649 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:25:01,651 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:25:01,651 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-time-subst.wvr.c [2025-04-13 22:25:02,917 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f062ef76a/dd5b1b0d0f6345de9173aba7e27a052a/FLAG5da419296 [2025-04-13 22:25:03,099 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:25:03,099 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-time-subst.wvr.c [2025-04-13 22:25:03,105 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f062ef76a/dd5b1b0d0f6345de9173aba7e27a052a/FLAG5da419296 [2025-04-13 22:25:03,919 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f062ef76a/dd5b1b0d0f6345de9173aba7e27a052a [2025-04-13 22:25:03,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:25:03,922 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:25:03,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:25:03,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:25:03,926 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:25:03,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:25:03" (1/1) ... [2025-04-13 22:25:03,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628f7b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:25:03, skipping insertion in model container [2025-04-13 22:25:03,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:25:03" (1/1) ... [2025-04-13 22:25:03,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:25:04,085 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-time-subst.wvr.c[2918,2931] [2025-04-13 22:25:04,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:25:04,101 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:25:04,122 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-time-subst.wvr.c[2918,2931] [2025-04-13 22:25:04,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:25:04,135 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:25:04,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:25:04 WrapperNode [2025-04-13 22:25:04,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:25:04,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:25:04,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:25:04,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:25:04,142 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:25:04" (1/1) ... [2025-04-13 22:25:04,150 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:25:04" (1/1) ... [2025-04-13 22:25:04,180 INFO L138 Inliner]: procedures = 22, calls = 24, calls flagged for inlining = 11, calls inlined = 21, statements flattened = 207 [2025-04-13 22:25:04,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:25:04,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:25:04,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:25:04,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:25:04,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:25:04" (1/1) ... [2025-04-13 22:25:04,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:25:04" (1/1) ... [2025-04-13 22:25:04,195 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:25:04" (1/1) ... [2025-04-13 22:25:04,214 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 22:25:04,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:25:04" (1/1) ... [2025-04-13 22:25:04,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:25:04" (1/1) ... [2025-04-13 22:25:04,220 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:25:04" (1/1) ... [2025-04-13 22:25:04,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:25:04" (1/1) ... [2025-04-13 22:25:04,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:25:04" (1/1) ... [2025-04-13 22:25:04,227 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:25:04" (1/1) ... [2025-04-13 22:25:04,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:25:04,231 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:25:04,231 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:25:04,232 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:25:04,232 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:25:04" (1/1) ... [2025-04-13 22:25:04,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:25:04,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:04,257 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:25:04,260 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:25:04,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:25:04,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:25:04,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:25:04,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:25:04,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:25:04,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:25:04,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:25:04,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:25:04,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 22:25:04,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 22:25:04,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:25:04,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:25:04,276 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:25:04,355 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:25:04,356 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:25:04,661 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:25:04,662 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:25:04,662 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:25:04,946 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:25:04,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:25:04 BoogieIcfgContainer [2025-04-13 22:25:04,946 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:25:04,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:25:04,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:25:04,952 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:25:04,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:25:03" (1/3) ... [2025-04-13 22:25:04,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a16045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:25:04, skipping insertion in model container [2025-04-13 22:25:04,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:25:04" (2/3) ... [2025-04-13 22:25:04,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a16045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:25:04, skipping insertion in model container [2025-04-13 22:25:04,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:25:04" (3/3) ... [2025-04-13 22:25:04,954 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-time-subst.wvr.c [2025-04-13 22:25:04,963 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:25:04,964 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-time-subst.wvr.c that has 4 procedures, 25 locations, 21 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 22:25:04,964 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:25:05,007 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 22:25:05,025 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 24 transitions, 69 flow [2025-04-13 22:25:05,051 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 192 states, 191 states have (on average 2.602094240837696) internal successors, (497), 191 states have internal predecessors, (497), 0 states have call successors, (0), 0 states 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:25:05,068 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:25:05,076 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;@21fae5f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:25:05,076 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 22:25:05,078 INFO L278 IsEmpty]: Start isEmpty. Operand has 192 states, 191 states have (on average 2.602094240837696) internal successors, (497), 191 states have internal predecessors, (497), 0 states have call successors, (0), 0 states 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:25:05,086 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:25:05,086 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:05,087 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:25:05,087 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:25:05,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:05,090 INFO L85 PathProgramCache]: Analyzing trace with hash 497762977, now seen corresponding path program 1 times [2025-04-13 22:25:05,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:05,095 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547785688] [2025-04-13 22:25:05,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:25:05,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:05,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:25:05,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:25:05,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:25:05,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:06,593 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:25:06,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:06,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547785688] [2025-04-13 22:25:06,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547785688] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:25:06,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:25:06,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:25:06,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28330042] [2025-04-13 22:25:06,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:25:06,601 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:25:06,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:06,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:25:06,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:25:06,617 INFO L87 Difference]: Start difference. First operand has 192 states, 191 states have (on average 2.602094240837696) internal successors, (497), 191 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 4 states have (on average 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:25:06,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:06,886 INFO L93 Difference]: Finished difference Result 256 states and 627 transitions. [2025-04-13 22:25:06,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:25:06,889 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 20 [2025-04-13 22:25:06,889 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:06,897 INFO L225 Difference]: With dead ends: 256 [2025-04-13 22:25:06,897 INFO L226 Difference]: Without dead ends: 216 [2025-04-13 22:25:06,900 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:25:06,903 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:06,904 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 20 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:25:06,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-04-13 22:25:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 192. [2025-04-13 22:25:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 2.56020942408377) internal successors, (489), 191 states have internal predecessors, (489), 0 states have call successors, (0), 0 states 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:25:06,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 489 transitions. [2025-04-13 22:25:06,949 INFO L79 Accepts]: Start accepts. Automaton has 192 states and 489 transitions. Word has length 20 [2025-04-13 22:25:06,950 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:06,950 INFO L485 AbstractCegarLoop]: Abstraction has 192 states and 489 transitions. [2025-04-13 22:25:06,950 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:25:06,950 INFO L278 IsEmpty]: Start isEmpty. Operand 192 states and 489 transitions. [2025-04-13 22:25:06,951 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:25:06,951 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:06,953 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:25:06,953 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:25:06,953 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:25:06,954 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:06,954 INFO L85 PathProgramCache]: Analyzing trace with hash 836788555, now seen corresponding path program 2 times [2025-04-13 22:25:06,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:06,954 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237737337] [2025-04-13 22:25:06,954 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:25:06,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:06,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:25:07,000 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:25:07,000 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:25:07,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:07,704 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:25:07,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:07,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237737337] [2025-04-13 22:25:07,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237737337] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:25:07,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:25:07,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:25:07,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839286084] [2025-04-13 22:25:07,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:25:07,706 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:25:07,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:07,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:25:07,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:25:07,706 INFO L87 Difference]: Start difference. First operand 192 states and 489 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:25:07,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:07,925 INFO L93 Difference]: Finished difference Result 270 states and 649 transitions. [2025-04-13 22:25:07,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:25:07,925 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 20 [2025-04-13 22:25:07,926 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:07,927 INFO L225 Difference]: With dead ends: 270 [2025-04-13 22:25:07,927 INFO L226 Difference]: Without dead ends: 192 [2025-04-13 22:25:07,929 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:25:07,930 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:07,930 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 20 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:25:07,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-04-13 22:25:07,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 168. [2025-04-13 22:25:07,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 2.497005988023952) internal successors, (417), 167 states have internal predecessors, (417), 0 states have call successors, (0), 0 states 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:25:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 417 transitions. [2025-04-13 22:25:07,944 INFO L79 Accepts]: Start accepts. Automaton has 168 states and 417 transitions. Word has length 20 [2025-04-13 22:25:07,944 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:07,944 INFO L485 AbstractCegarLoop]: Abstraction has 168 states and 417 transitions. [2025-04-13 22:25:07,944 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:25:07,945 INFO L278 IsEmpty]: Start isEmpty. Operand 168 states and 417 transitions. [2025-04-13 22:25:07,945 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:25:07,945 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:07,946 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:25:07,946 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:25:07,946 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:25:07,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:07,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1945795231, now seen corresponding path program 3 times [2025-04-13 22:25:07,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:07,946 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133510792] [2025-04-13 22:25:07,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:25:07,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:07,959 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:25:07,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:25:07,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:25:07,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:08,529 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:25:08,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:08,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133510792] [2025-04-13 22:25:08,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133510792] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:25:08,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:25:08,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:25:08,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290810752] [2025-04-13 22:25:08,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:25:08,531 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:25:08,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:08,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:25:08,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:25:08,531 INFO L87 Difference]: Start difference. First operand 168 states and 417 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:25:08,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:08,751 INFO L93 Difference]: Finished difference Result 216 states and 507 transitions. [2025-04-13 22:25:08,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:25:08,751 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 20 [2025-04-13 22:25:08,751 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:08,752 INFO L225 Difference]: With dead ends: 216 [2025-04-13 22:25:08,752 INFO L226 Difference]: Without dead ends: 176 [2025-04-13 22:25:08,753 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:25:08,753 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 20 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:25:08,753 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 20 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:25:08,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-04-13 22:25:08,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 152. [2025-04-13 22:25:08,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 2.443708609271523) internal successors, (369), 151 states have internal predecessors, (369), 0 states have call successors, (0), 0 states 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:25:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 369 transitions. [2025-04-13 22:25:08,759 INFO L79 Accepts]: Start accepts. Automaton has 152 states and 369 transitions. Word has length 20 [2025-04-13 22:25:08,759 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:08,759 INFO L485 AbstractCegarLoop]: Abstraction has 152 states and 369 transitions. [2025-04-13 22:25:08,759 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:25:08,759 INFO L278 IsEmpty]: Start isEmpty. Operand 152 states and 369 transitions. [2025-04-13 22:25:08,760 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:25:08,760 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:08,760 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:25:08,760 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:25:08,760 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:25:08,760 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:08,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1995692875, now seen corresponding path program 4 times [2025-04-13 22:25:08,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:08,760 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041466943] [2025-04-13 22:25:08,760 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:25:08,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:08,767 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:25:08,778 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:25:08,778 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:25:08,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:09,270 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:25:09,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:09,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041466943] [2025-04-13 22:25:09,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041466943] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:25:09,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:25:09,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:25:09,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791990448] [2025-04-13 22:25:09,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:25:09,271 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:25:09,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:09,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:25:09,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:25:09,271 INFO L87 Difference]: Start difference. First operand 152 states and 369 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:25:09,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:09,481 INFO L93 Difference]: Finished difference Result 196 states and 464 transitions. [2025-04-13 22:25:09,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:25:09,481 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 20 [2025-04-13 22:25:09,481 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:09,482 INFO L225 Difference]: With dead ends: 196 [2025-04-13 22:25:09,482 INFO L226 Difference]: Without dead ends: 136 [2025-04-13 22:25:09,482 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:25:09,483 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 27 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:09,483 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 20 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:25:09,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-04-13 22:25:09,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-04-13 22:25:09,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.3777777777777778) internal successors, (321), 135 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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:25:09,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 321 transitions. [2025-04-13 22:25:09,491 INFO L79 Accepts]: Start accepts. Automaton has 136 states and 321 transitions. Word has length 20 [2025-04-13 22:25:09,491 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:09,491 INFO L485 AbstractCegarLoop]: Abstraction has 136 states and 321 transitions. [2025-04-13 22:25:09,491 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:25:09,491 INFO L278 IsEmpty]: Start isEmpty. Operand 136 states and 321 transitions. [2025-04-13 22:25:09,495 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:25:09,495 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:09,495 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:25:09,495 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:25:09,496 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:25:09,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:09,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1828457185, now seen corresponding path program 5 times [2025-04-13 22:25:09,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:09,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225175976] [2025-04-13 22:25:09,496 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:25:09,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:09,503 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:25:09,514 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:25:09,514 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:25:09,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:09,949 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:25:09,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:09,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225175976] [2025-04-13 22:25:09,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225175976] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:25:09,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:25:09,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:25:09,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426005211] [2025-04-13 22:25:09,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:25:09,949 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:25:09,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:09,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:25:09,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:25:09,950 INFO L87 Difference]: Start difference. First operand 136 states and 321 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:25:10,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:10,102 INFO L93 Difference]: Finished difference Result 160 states and 366 transitions. [2025-04-13 22:25:10,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:25:10,102 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 20 [2025-04-13 22:25:10,102 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:10,103 INFO L225 Difference]: With dead ends: 160 [2025-04-13 22:25:10,103 INFO L226 Difference]: Without dead ends: 106 [2025-04-13 22:25:10,103 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:25:10,105 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 32 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:10,105 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 20 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:25:10,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-04-13 22:25:10,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-04-13 22:25:10,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 2.257142857142857) internal successors, (237), 105 states have internal predecessors, (237), 0 states have call successors, (0), 0 states 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:25:10,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 237 transitions. [2025-04-13 22:25:10,108 INFO L79 Accepts]: Start accepts. Automaton has 106 states and 237 transitions. Word has length 20 [2025-04-13 22:25:10,108 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:10,108 INFO L485 AbstractCegarLoop]: Abstraction has 106 states and 237 transitions. [2025-04-13 22:25:10,108 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:25:10,112 INFO L278 IsEmpty]: Start isEmpty. Operand 106 states and 237 transitions. [2025-04-13 22:25:10,113 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:25:10,113 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:10,113 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:25:10,113 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:25:10,113 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:25:10,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:10,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1465854669, now seen corresponding path program 6 times [2025-04-13 22:25:10,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:10,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663375767] [2025-04-13 22:25:10,114 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:25:10,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:10,123 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:25:10,138 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:25:10,138 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:25:10,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:10,548 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:25:10,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:10,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663375767] [2025-04-13 22:25:10,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663375767] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:25:10,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:25:10,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:25:10,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014213661] [2025-04-13 22:25:10,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:25:10,549 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:25:10,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:10,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:25:10,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:25:10,549 INFO L87 Difference]: Start difference. First operand 106 states and 237 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:25:10,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:10,665 INFO L93 Difference]: Finished difference Result 106 states and 237 transitions. [2025-04-13 22:25:10,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:25:10,666 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 20 [2025-04-13 22:25:10,666 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:10,666 INFO L225 Difference]: With dead ends: 106 [2025-04-13 22:25:10,666 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 22:25:10,667 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:25:10,667 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 24 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 20 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:25:10,667 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 20 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:25:10,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 22:25:10,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 22:25:10,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states 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:25:10,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 22:25:10,668 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2025-04-13 22:25:10,668 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:10,668 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 22:25:10,668 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:25:10,668 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 22:25:10,669 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 22:25:10,670 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 22:25:10,671 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 22:25:10,671 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 22:25:10,671 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 22:25:10,671 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 22:25:10,673 INFO L422 BasicCegarLoop]: Path program histogram: [6] [2025-04-13 22:25:10,675 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:25:10,675 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:25:10,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:25:10 BasicIcfg [2025-04-13 22:25:10,677 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:25:10,678 INFO L158 Benchmark]: Toolchain (without parser) took 6755.71ms. Allocated memory was 155.2MB in the beginning and 461.4MB in the end (delta: 306.2MB). Free memory was 110.2MB in the beginning and 266.0MB in the end (delta: -155.8MB). Peak memory consumption was 146.8MB. Max. memory is 8.0GB. [2025-04-13 22:25:10,678 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:25:10,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.21ms. Allocated memory is still 155.2MB. Free memory was 109.7MB in the beginning and 95.5MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 22:25:10,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.53ms. Allocated memory is still 155.2MB. Free memory was 95.5MB in the beginning and 93.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:25:10,679 INFO L158 Benchmark]: Boogie Preprocessor took 50.14ms. Allocated memory is still 155.2MB. Free memory was 93.0MB in the beginning and 90.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:25:10,679 INFO L158 Benchmark]: IcfgBuilder took 715.07ms. Allocated memory is still 155.2MB. Free memory was 90.8MB in the beginning and 76.8MB in the end (delta: 14.0MB). Peak memory consumption was 74.4MB. Max. memory is 8.0GB. [2025-04-13 22:25:10,679 INFO L158 Benchmark]: TraceAbstraction took 5728.89ms. Allocated memory was 155.2MB in the beginning and 461.4MB in the end (delta: 306.2MB). Free memory was 76.0MB in the beginning and 266.0MB in the end (delta: -190.0MB). Peak memory consumption was 114.3MB. Max. memory is 8.0GB. [2025-04-13 22:25:10,680 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.18ms. Allocated memory is still 159.4MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 214.21ms. Allocated memory is still 155.2MB. Free memory was 109.7MB in the beginning and 95.5MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.53ms. Allocated memory is still 155.2MB. Free memory was 95.5MB in the beginning and 93.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.14ms. Allocated memory is still 155.2MB. Free memory was 93.0MB in the beginning and 90.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 715.07ms. Allocated memory is still 155.2MB. Free memory was 90.8MB in the beginning and 76.8MB in the end (delta: 14.0MB). Peak memory consumption was 74.4MB. Max. memory is 8.0GB. * TraceAbstraction took 5728.89ms. Allocated memory was 155.2MB in the beginning and 461.4MB in the end (delta: 306.2MB). Free memory was 76.0MB in the beginning and 266.0MB in the end (delta: -190.0MB). Peak memory consumption was 114.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 93]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 40 locations, 39 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 173 mSDsluCounter, 120 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 545 IncrementalHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 36 mSDtfsCounter, 545 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred in iteration=0, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 72 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 3380 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 22:25:10,697 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 0 Received shutdown request...