/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/pthread/fib_safe-11.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 16:53:36,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 16:53:36,261 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 16:53:36,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 16:53:36,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 16:53:36,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 16:53:36,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 16:53:36,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 16:53:36,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 16:53:36,290 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 16:53:36,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 16:53:36,290 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 16:53:36,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 16:53:36,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 16:53:36,290 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 16:53:36,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 16:53:36,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 16:53:36,290 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 16:53:36,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 16:53:36,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 16:53:36,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 16:53:36,290 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 16:53:36,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 16:53:36,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 16:53:36,291 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 16:53:36,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 16:53:36,291 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 16:53:36,291 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 16:53:36,291 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 16:53:36,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 16:53:36,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 16:53:36,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 16:53:36,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 16:53:36,291 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 16:53:36,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 16:53:36,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 16:53:36,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 16:53:36,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 16:53:36,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 16:53:36,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 16:53:36,292 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 16:53:36,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 16:53:36,292 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 16:53:36,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 16:53:36,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 16:53:36,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 16:53:36,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 16:53:36,292 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 16:53:36,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 16:53:36,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 16:53:36,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 16:53:36,520 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 16:53:36,521 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 16:53:36,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_safe-11.i [2025-04-13 16:53:37,786 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5f2dbe9/863448a93da84f44a56a142194d0e6e5/FLAG52587a913 [2025-04-13 16:53:38,011 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 16:53:38,011 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-11.i [2025-04-13 16:53:38,020 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5f2dbe9/863448a93da84f44a56a142194d0e6e5/FLAG52587a913 [2025-04-13 16:53:38,837 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5f2dbe9/863448a93da84f44a56a142194d0e6e5 [2025-04-13 16:53:38,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 16:53:38,839 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 16:53:38,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 16:53:38,840 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 16:53:38,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 16:53:38,844 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:53:38" (1/1) ... [2025-04-13 16:53:38,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76ad78f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:38, skipping insertion in model container [2025-04-13 16:53:38,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:53:38" (1/1) ... [2025-04-13 16:53:38,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 16:53:39,120 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-11.i[30241,30254] [2025-04-13 16:53:39,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 16:53:39,151 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 16:53:39,198 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-11.i[30241,30254] [2025-04-13 16:53:39,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 16:53:39,223 INFO L204 MainTranslator]: Completed translation [2025-04-13 16:53:39,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39 WrapperNode [2025-04-13 16:53:39,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 16:53:39,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 16:53:39,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 16:53:39,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 16:53:39,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,262 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-04-13 16:53:39,262 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 16:53:39,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 16:53:39,263 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 16:53:39,263 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 16:53:39,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,282 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 16:53:39,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,287 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,288 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,291 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,292 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 16:53:39,297 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 16:53:39,297 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 16:53:39,297 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 16:53:39,297 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (1/1) ... [2025-04-13 16:53:39,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 16:53:39,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:53:39,323 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 16:53:39,325 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 16:53:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 16:53:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 16:53:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 16:53:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 16:53:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 16:53:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 16:53:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 16:53:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 16:53:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 16:53:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 16:53:39,342 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 16:53:39,431 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 16:53:39,432 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 16:53:39,537 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 16:53:39,537 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 16:53:39,538 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 16:53:39,607 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 16:53:39,609 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 16:53:39,612 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 16:53:39,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:53:39 BoogieIcfgContainer [2025-04-13 16:53:39,612 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 16:53:39,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 16:53:39,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 16:53:39,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 16:53:39,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 04:53:38" (1/3) ... [2025-04-13 16:53:39,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e33d65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:53:39, skipping insertion in model container [2025-04-13 16:53:39,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:39" (2/3) ... [2025-04-13 16:53:39,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e33d65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:53:39, skipping insertion in model container [2025-04-13 16:53:39,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:53:39" (3/3) ... [2025-04-13 16:53:39,618 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_safe-11.i [2025-04-13 16:53:39,634 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 16:53:39,635 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_safe-11.i that has 3 procedures, 21 locations, 23 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 16:53:39,635 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 16:53:39,661 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 16:53:39,682 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 25 transitions, 58 flow [2025-04-13 16:53:39,706 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 93 states, 92 states have (on average 3.2934782608695654) internal successors, (303), 92 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:53:39,728 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 16:53:39,736 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;@57bef09a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 16:53:39,737 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 16:53:39,738 INFO L278 IsEmpty]: Start isEmpty. Operand has 93 states, 92 states have (on average 3.2934782608695654) internal successors, (303), 92 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:53:39,742 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 16:53:39,742 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:39,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:39,743 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 16:53:39,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:39,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1561770242, now seen corresponding path program 1 times [2025-04-13 16:53:39,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:39,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544070447] [2025-04-13 16:53:39,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:53:39,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:39,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 16:53:39,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 16:53:39,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:53:39,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:39,948 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 16:53:39,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:39,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544070447] [2025-04-13 16:53:39,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544070447] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:53:39,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:53:39,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 16:53:39,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262950094] [2025-04-13 16:53:39,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:53:39,957 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 16:53:39,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:39,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 16:53:39,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 16:53:39,976 INFO L87 Difference]: Start difference. First operand has 93 states, 92 states have (on average 3.2934782608695654) internal successors, (303), 92 states have internal predecessors, (303), 0 states have call successors, (0), 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 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:53:40,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:53:40,055 INFO L93 Difference]: Finished difference Result 173 states and 570 transitions. [2025-04-13 16:53:40,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 16:53:40,058 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2025-04-13 16:53:40,058 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:53:40,066 INFO L225 Difference]: With dead ends: 173 [2025-04-13 16:53:40,066 INFO L226 Difference]: Without dead ends: 109 [2025-04-13 16:53:40,068 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 16:53:40,070 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 16:53:40,070 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 8 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 16:53:40,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-04-13 16:53:40,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-04-13 16:53:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 2.861111111111111) internal successors, (309), 108 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:53:40,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 309 transitions. [2025-04-13 16:53:40,103 INFO L79 Accepts]: Start accepts. Automaton has 109 states and 309 transitions. Word has length 11 [2025-04-13 16:53:40,104 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:53:40,104 INFO L485 AbstractCegarLoop]: Abstraction has 109 states and 309 transitions. [2025-04-13 16:53:40,104 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:53:40,104 INFO L278 IsEmpty]: Start isEmpty. Operand 109 states and 309 transitions. [2025-04-13 16:53:40,108 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 16:53:40,109 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:40,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:40,109 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 16:53:40,109 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 16:53:40,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:40,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1170211856, now seen corresponding path program 1 times [2025-04-13 16:53:40,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:40,110 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076221941] [2025-04-13 16:53:40,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:53:40,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:40,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 16:53:40,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 16:53:40,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:53:40,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:40,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:40,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076221941] [2025-04-13 16:53:40,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076221941] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:53:40,221 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10020533] [2025-04-13 16:53:40,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:53:40,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:53:40,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:53:40,225 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 16:53:40,227 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 16:53:40,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 16:53:40,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 16:53:40,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:53:40,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:40,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 16:53:40,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:53:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:40,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:53:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:40,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10020533] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:53:40,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:53:40,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-13 16:53:40,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255352525] [2025-04-13 16:53:40,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:53:40,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 16:53:40,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:40,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 16:53:40,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 16:53:40,344 INFO L87 Difference]: Start difference. First operand 109 states and 309 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 16:53:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:53:40,411 INFO L93 Difference]: Finished difference Result 205 states and 629 transitions. [2025-04-13 16:53:40,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 16:53:40,411 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 12 [2025-04-13 16:53:40,411 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:53:40,413 INFO L225 Difference]: With dead ends: 205 [2025-04-13 16:53:40,413 INFO L226 Difference]: Without dead ends: 157 [2025-04-13 16:53:40,413 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 16:53:40,413 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 74 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 16:53:40,414 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 15 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 16:53:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-04-13 16:53:40,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-04-13 16:53:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 2.9038461538461537) internal successors, (453), 156 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:53:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 453 transitions. [2025-04-13 16:53:40,428 INFO L79 Accepts]: Start accepts. Automaton has 157 states and 453 transitions. Word has length 12 [2025-04-13 16:53:40,429 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:53:40,429 INFO L485 AbstractCegarLoop]: Abstraction has 157 states and 453 transitions. [2025-04-13 16:53:40,429 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 16:53:40,429 INFO L278 IsEmpty]: Start isEmpty. Operand 157 states and 453 transitions. [2025-04-13 16:53:40,432 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 16:53:40,432 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:40,432 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:40,439 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 16:53:40,633 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 16:53:40,633 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 16:53:40,633 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:40,633 INFO L85 PathProgramCache]: Analyzing trace with hash 493351806, now seen corresponding path program 2 times [2025-04-13 16:53:40,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:40,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518915024] [2025-04-13 16:53:40,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 16:53:40,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:40,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 16:53:40,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 16:53:40,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 16:53:40,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:40,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:40,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518915024] [2025-04-13 16:53:40,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518915024] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:53:40,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241802344] [2025-04-13 16:53:40,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 16:53:40,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:53:40,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:53:40,748 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 16:53:40,750 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 16:53:40,784 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 16:53:40,798 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 16:53:40,798 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 16:53:40,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:40,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 16:53:40,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:53:40,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:40,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:53:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:40,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241802344] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:53:40,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:53:40,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 16:53:40,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143576980] [2025-04-13 16:53:40,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:53:40,875 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 16:53:40,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:40,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 16:53:40,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 16:53:40,875 INFO L87 Difference]: Start difference. First operand 157 states and 453 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 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 16:53:41,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:53:41,019 INFO L93 Difference]: Finished difference Result 301 states and 965 transitions. [2025-04-13 16:53:41,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 16:53:41,019 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 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 15 [2025-04-13 16:53:41,020 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:53:41,021 INFO L225 Difference]: With dead ends: 301 [2025-04-13 16:53:41,021 INFO L226 Difference]: Without dead ends: 253 [2025-04-13 16:53:41,022 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 16:53:41,023 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 196 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 16:53:41,024 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 28 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 16:53:41,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-04-13 16:53:41,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-04-13 16:53:41,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 2.9404761904761907) internal successors, (741), 252 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:53:41,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 741 transitions. [2025-04-13 16:53:41,038 INFO L79 Accepts]: Start accepts. Automaton has 253 states and 741 transitions. Word has length 15 [2025-04-13 16:53:41,038 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:53:41,038 INFO L485 AbstractCegarLoop]: Abstraction has 253 states and 741 transitions. [2025-04-13 16:53:41,038 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 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 16:53:41,038 INFO L278 IsEmpty]: Start isEmpty. Operand 253 states and 741 transitions. [2025-04-13 16:53:41,039 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 16:53:41,039 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:41,039 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:41,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 16:53:41,243 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-13 16:53:41,243 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 16:53:41,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:41,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1439646146, now seen corresponding path program 3 times [2025-04-13 16:53:41,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:41,243 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949688971] [2025-04-13 16:53:41,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 16:53:41,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:41,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-04-13 16:53:41,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 16:53:41,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 16:53:41,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:41,441 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:41,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:41,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949688971] [2025-04-13 16:53:41,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949688971] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:53:41,442 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767829416] [2025-04-13 16:53:41,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 16:53:41,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:53:41,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:53:41,445 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 16:53:41,446 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 16:53:41,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-04-13 16:53:41,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 16:53:41,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 16:53:41,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:41,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 16:53:41,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:53:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:41,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:53:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:41,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767829416] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:53:41,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:53:41,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-04-13 16:53:41,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629857986] [2025-04-13 16:53:41,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:53:41,728 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 16:53:41,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:41,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 16:53:41,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-04-13 16:53:41,729 INFO L87 Difference]: Start difference. First operand 253 states and 741 transitions. Second operand has 25 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:53:41,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:53:41,950 INFO L93 Difference]: Finished difference Result 493 states and 1637 transitions. [2025-04-13 16:53:41,950 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 16:53:41,951 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 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 21 [2025-04-13 16:53:41,951 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:53:41,954 INFO L225 Difference]: With dead ends: 493 [2025-04-13 16:53:41,954 INFO L226 Difference]: Without dead ends: 445 [2025-04-13 16:53:41,954 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-04-13 16:53:41,955 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 332 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 16:53:41,955 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 58 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 16:53:41,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-04-13 16:53:41,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2025-04-13 16:53:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 2.9662162162162162) internal successors, (1317), 444 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:53:41,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1317 transitions. [2025-04-13 16:53:41,984 INFO L79 Accepts]: Start accepts. Automaton has 445 states and 1317 transitions. Word has length 21 [2025-04-13 16:53:41,984 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:53:41,984 INFO L485 AbstractCegarLoop]: Abstraction has 445 states and 1317 transitions. [2025-04-13 16:53:41,985 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:53:41,985 INFO L278 IsEmpty]: Start isEmpty. Operand 445 states and 1317 transitions. [2025-04-13 16:53:41,986 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 16:53:41,987 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:41,987 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:41,993 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 16:53:42,191 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:53:42,191 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 16:53:42,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:42,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1097522242, now seen corresponding path program 4 times [2025-04-13 16:53:42,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:42,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291116980] [2025-04-13 16:53:42,192 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 16:53:42,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:42,200 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 16:53:42,214 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 16:53:42,214 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 16:53:42,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:42,603 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:42,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:42,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291116980] [2025-04-13 16:53:42,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291116980] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:53:42,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821200530] [2025-04-13 16:53:42,603 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 16:53:42,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:53:42,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:53:42,606 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 16:53:42,607 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 16:53:42,646 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 16:53:42,673 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 16:53:42,673 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 16:53:42,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:42,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 16:53:42,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:53:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:42,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:53:43,015 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:43,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821200530] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:53:43,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:53:43,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 26 [2025-04-13 16:53:43,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480895595] [2025-04-13 16:53:43,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:53:43,016 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 16:53:43,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:43,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 16:53:43,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2025-04-13 16:53:43,017 INFO L87 Difference]: Start difference. First operand 445 states and 1317 transitions. Second operand has 26 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:53:43,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:53:43,250 INFO L93 Difference]: Finished difference Result 525 states and 1573 transitions. [2025-04-13 16:53:43,250 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 16:53:43,250 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 16:53:43,251 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:53:43,253 INFO L225 Difference]: With dead ends: 525 [2025-04-13 16:53:43,253 INFO L226 Difference]: Without dead ends: 477 [2025-04-13 16:53:43,254 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 43 SyntacticMatches, 22 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2025-04-13 16:53:43,254 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 440 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 16:53:43,254 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 61 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 16:53:43,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-04-13 16:53:43,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2025-04-13 16:53:43,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 2.9684873949579833) internal successors, (1413), 476 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:53:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1413 transitions. [2025-04-13 16:53:43,271 INFO L79 Accepts]: Start accepts. Automaton has 477 states and 1413 transitions. Word has length 33 [2025-04-13 16:53:43,271 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:53:43,271 INFO L485 AbstractCegarLoop]: Abstraction has 477 states and 1413 transitions. [2025-04-13 16:53:43,271 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:53:43,271 INFO L278 IsEmpty]: Start isEmpty. Operand 477 states and 1413 transitions. [2025-04-13 16:53:43,274 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 16:53:43,274 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:43,274 INFO L218 NwaCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:43,281 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 16:53:43,474 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:53:43,475 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 16:53:43,475 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:43,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1843892734, now seen corresponding path program 5 times [2025-04-13 16:53:43,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:43,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169770322] [2025-04-13 16:53:43,476 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 16:53:43,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:43,483 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 13 equivalence classes. [2025-04-13 16:53:43,581 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 16:53:43,582 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-04-13 16:53:43,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:45,129 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:45,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:45,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169770322] [2025-04-13 16:53:45,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169770322] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:53:45,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790871704] [2025-04-13 16:53:45,129 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 16:53:45,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:53:45,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:53:45,131 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 16:53:45,134 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 16:53:45,173 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 13 equivalence classes. [2025-04-13 16:53:45,210 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 16:53:45,210 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-04-13 16:53:45,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:45,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-04-13 16:53:45,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:53:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 253 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:46,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:53:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:48,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790871704] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:53:48,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:53:48,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 86 [2025-04-13 16:53:48,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316011973] [2025-04-13 16:53:48,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:53:48,028 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2025-04-13 16:53:48,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:48,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2025-04-13 16:53:48,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1160, Invalid=6496, Unknown=0, NotChecked=0, Total=7656 [2025-04-13 16:53:48,030 INFO L87 Difference]: Start difference. First operand 477 states and 1413 transitions. Second operand has 88 states, 87 states have (on average 1.1954022988505748) internal successors, (104), 87 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:56:13,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:56:13,278 INFO L93 Difference]: Finished difference Result 47930 states and 143842 transitions. [2025-04-13 16:56:13,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 727 states. [2025-04-13 16:56:13,278 INFO L79 Accepts]: Start accepts. Automaton has has 88 states, 87 states have (on average 1.1954022988505748) internal successors, (104), 87 states have internal predecessors, (104), 0 states have call successors, (0), 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 16:56:13,278 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:56:13,478 INFO L225 Difference]: With dead ends: 47930 [2025-04-13 16:56:13,479 INFO L226 Difference]: Without dead ends: 45500 [2025-04-13 16:56:13,553 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 821 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 810 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321471 ImplicationChecksByTransitivity, 134.2s TimeCoverageRelationStatistics Valid=162871, Invalid=495661, Unknown=0, NotChecked=0, Total=658532 [2025-04-13 16:56:13,554 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 5906 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 9006 mSolverCounterSat, 915 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5906 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 9921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 915 IncrementalHoareTripleChecker+Valid, 9006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-04-13 16:56:13,554 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5906 Valid, 4 Invalid, 9921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [915 Valid, 9006 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-04-13 16:56:13,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45500 states. [2025-04-13 16:56:17,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45500 to 38809. [2025-04-13 16:56:17,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38809 states, 38808 states have (on average 3.054499072356215) internal successors, (118539), 38808 states have internal predecessors, (118539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:56:17,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38809 states to 38809 states and 118539 transitions. [2025-04-13 16:56:17,724 INFO L79 Accepts]: Start accepts. Automaton has 38809 states and 118539 transitions. Word has length 35 [2025-04-13 16:56:17,725 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:56:17,725 INFO L485 AbstractCegarLoop]: Abstraction has 38809 states and 118539 transitions. [2025-04-13 16:56:17,725 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 87 states have (on average 1.1954022988505748) internal successors, (104), 87 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:56:17,725 INFO L278 IsEmpty]: Start isEmpty. Operand 38809 states and 118539 transitions. [2025-04-13 16:56:17,750 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 16:56:17,750 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:56:17,750 INFO L218 NwaCegarLoop]: trace histogram [24, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:56:17,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 16:56:17,951 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:56:17,951 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 16:56:17,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:56:17,952 INFO L85 PathProgramCache]: Analyzing trace with hash -492483243, now seen corresponding path program 1 times [2025-04-13 16:56:17,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:56:17,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465635942] [2025-04-13 16:56:17,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:56:17,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:56:17,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 16:56:17,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 16:56:17,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:56:17,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:56:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:56:19,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:56:19,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465635942] [2025-04-13 16:56:19,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465635942] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:56:19,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72707650] [2025-04-13 16:56:19,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:56:19,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:56:19,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:56:19,241 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 16:56:19,243 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 16:56:19,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 16:56:19,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 16:56:19,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:56:19,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:56:19,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-04-13 16:56:19,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:56:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 253 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:56:20,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:56:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:56:22,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72707650] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:56:22,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:56:22,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2025-04-13 16:56:22,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112663053] [2025-04-13 16:56:22,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:56:22,043 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2025-04-13 16:56:22,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:56:22,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2025-04-13 16:56:22,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1236, Invalid=7694, Unknown=0, NotChecked=0, Total=8930 [2025-04-13 16:56:22,045 INFO L87 Difference]: Start difference. First operand 38809 states and 118539 transitions. Second operand has 95 states, 94 states have (on average 1.2446808510638299) internal successors, (117), 94 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:59:09,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:59:09,825 INFO L93 Difference]: Finished difference Result 234775 states and 729493 transitions. [2025-04-13 16:59:09,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 743 states. [2025-04-13 16:59:09,826 INFO L79 Accepts]: Start accepts. Automaton has has 95 states, 94 states have (on average 1.2446808510638299) internal successors, (117), 94 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 16:59:09,826 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:59:11,021 INFO L225 Difference]: With dead ends: 234775 [2025-04-13 16:59:11,021 INFO L226 Difference]: Without dead ends: 232883 [2025-04-13 16:59:11,148 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 828 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332512 ImplicationChecksByTransitivity, 127.5s TimeCoverageRelationStatistics Valid=131708, Invalid=556362, Unknown=0, NotChecked=0, Total=688070 [2025-04-13 16:59:11,149 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 6758 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 13614 mSolverCounterSat, 1881 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6758 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 15495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1881 IncrementalHoareTripleChecker+Valid, 13614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2025-04-13 16:59:11,149 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6758 Valid, 4 Invalid, 15495 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1881 Valid, 13614 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2025-04-13 16:59:11,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232883 states. [2025-04-13 16:59:35,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232883 to 174275. [2025-04-13 16:59:36,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174275 states, 174274 states have (on average 3.385088997785097) internal successors, (589933), 174274 states have internal predecessors, (589933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:59:37,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174275 states to 174275 states and 589933 transitions. [2025-04-13 16:59:37,769 INFO L79 Accepts]: Start accepts. Automaton has 174275 states and 589933 transitions. Word has length 39 [2025-04-13 16:59:37,769 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:59:37,769 INFO L485 AbstractCegarLoop]: Abstraction has 174275 states and 589933 transitions. [2025-04-13 16:59:37,770 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 94 states have (on average 1.2446808510638299) internal successors, (117), 94 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:59:37,770 INFO L278 IsEmpty]: Start isEmpty. Operand 174275 states and 589933 transitions. [2025-04-13 16:59:37,860 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 16:59:37,861 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:59:37,861 INFO L218 NwaCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:59:37,866 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 16:59:38,061 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:59:38,062 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 16:59:38,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:59:38,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2103900084, now seen corresponding path program 1 times [2025-04-13 16:59:38,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:59:38,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047488846] [2025-04-13 16:59:38,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:59:38,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:59:38,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 16:59:38,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 16:59:38,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:59:38,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:59:39,378 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:59:39,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:59:39,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047488846] [2025-04-13 16:59:39,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047488846] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:59:39,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321020026] [2025-04-13 16:59:39,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:59:39,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:59:39,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:59:39,380 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 16:59:39,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 16:59:39,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 16:59:39,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 16:59:39,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:59:39,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:59:39,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-04-13 16:59:39,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:59:40,540 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 253 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:59:40,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:59:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:59:41,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321020026] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:59:41,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:59:41,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 92 [2025-04-13 16:59:41,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447586576] [2025-04-13 16:59:41,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:59:41,760 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2025-04-13 16:59:41,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:59:41,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2025-04-13 16:59:41,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=7469, Unknown=0, NotChecked=0, Total=8742 [2025-04-13 16:59:41,761 INFO L87 Difference]: Start difference. First operand 174275 states and 589933 transitions. Second operand has 94 states, 93 states have (on average 1.2580645161290323) internal successors, (117), 93 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:03:13,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:03:13,544 INFO L93 Difference]: Finished difference Result 542959 states and 1837702 transitions. [2025-04-13 17:03:13,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 792 states. [2025-04-13 17:03:13,544 INFO L79 Accepts]: Start accepts. Automaton has has 94 states, 93 states have (on average 1.2580645161290323) internal successors, (117), 93 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 17:03:13,545 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:03:19,081 INFO L225 Difference]: With dead ends: 542959 [2025-04-13 17:03:19,083 INFO L226 Difference]: Without dead ends: 540914 [2025-04-13 17:03:19,351 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 891 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 876 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373413 ImplicationChecksByTransitivity, 95.9s TimeCoverageRelationStatistics Valid=164163, Invalid=605843, Unknown=0, NotChecked=0, Total=770006 [2025-04-13 17:03:19,352 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 6202 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 12805 mSolverCounterSat, 1325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6202 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 14130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1325 IncrementalHoareTripleChecker+Valid, 12805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:03:19,352 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6202 Valid, 8 Invalid, 14130 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1325 Valid, 12805 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-04-13 17:03:19,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540914 states. [2025-04-13 17:04:46,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540914 to 483572. [2025-04-13 17:04:47,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483572 states, 483571 states have (on average 3.5024081262110425) internal successors, (1693663), 483571 states have internal predecessors, (1693663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:04:51,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483572 states to 483572 states and 1693663 transitions. [2025-04-13 17:04:51,849 INFO L79 Accepts]: Start accepts. Automaton has 483572 states and 1693663 transitions. Word has length 39 [2025-04-13 17:04:51,851 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:04:51,851 INFO L485 AbstractCegarLoop]: Abstraction has 483572 states and 1693663 transitions. [2025-04-13 17:04:51,851 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 93 states have (on average 1.2580645161290323) internal successors, (117), 93 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:04:51,851 INFO L278 IsEmpty]: Start isEmpty. Operand 483572 states and 1693663 transitions. [2025-04-13 17:04:52,265 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 17:04:52,266 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:04:52,266 INFO L218 NwaCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:04:52,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 17:04:52,466 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:04:52,467 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:04:52,467 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:04:52,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1842506486, now seen corresponding path program 2 times [2025-04-13 17:04:52,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:04:52,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243175191] [2025-04-13 17:04:52,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:04:52,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:04:52,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-13 17:04:52,637 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:04:52,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:04:52,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:04:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:04:54,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:04:54,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243175191] [2025-04-13 17:04:54,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243175191] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:04:54,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525637799] [2025-04-13 17:04:54,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:04:54,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:04:54,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:04:54,630 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:04:54,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 17:04:54,686 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-13 17:04:54,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 17:04:54,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:04:54,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:04:54,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-04-13 17:04:54,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:04:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 253 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:04:56,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:04:57,677 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:04:57,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525637799] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:04:57,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:04:57,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 92 [2025-04-13 17:04:57,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931862642] [2025-04-13 17:04:57,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:04:57,678 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2025-04-13 17:04:57,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:04:57,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2025-04-13 17:04:57,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1253, Invalid=7489, Unknown=0, NotChecked=0, Total=8742 [2025-04-13 17:04:57,680 INFO L87 Difference]: Start difference. First operand 483572 states and 1693663 transitions. Second operand has 94 states, 93 states have (on average 1.2580645161290323) internal successors, (117), 93 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2025-04-13 17:06:30,098 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 17:06:30,101 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 17:06:30,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 286 states. [2025-04-13 17:06:30,115 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54548 ImplicationChecksByTransitivity, 31.5s TimeCoverageRelationStatistics Valid=34748, Invalid=104754, Unknown=0, NotChecked=0, Total=139502 [2025-04-13 17:06:30,116 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 2471 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 8229 mSolverCounterSat, 1040 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2471 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 9269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1040 IncrementalHoareTripleChecker+Valid, 8229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:30,116 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2471 Valid, 6 Invalid, 9269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1040 Valid, 8229 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-04-13 17:06:30,118 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 17:06:30,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 17:06:30,323 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-04-13 17:06:30,324 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (483572states) and FLOYD_HOARE automaton (currently 286 states, 94 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-39-1 term,while SimplifyDDA2 was simplifying 27 xjuncts wrt. a ATOM-1 context. [2025-04-13 17:06:30,326 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 17:06:30,335 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 17:06:30,347 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1] [2025-04-13 17:06:30,358 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 17:06:30,358 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:06:30,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:06:30 BasicIcfg [2025-04-13 17:06:30,373 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:06:30,373 INFO L158 Benchmark]: Toolchain (without parser) took 771533.81ms. Allocated memory was 142.6MB in the beginning and 7.3GB in the end (delta: 7.2GB). Free memory was 99.6MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 5.1GB. Max. memory is 8.0GB. [2025-04-13 17:06:30,378 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:06:30,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.14ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 77.0MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 17:06:30,378 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.75ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 75.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:06:30,378 INFO L158 Benchmark]: Boogie Preprocessor took 33.19ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 72.8MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:06:30,379 INFO L158 Benchmark]: RCFGBuilder took 315.41ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 46.7MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 17:06:30,379 INFO L158 Benchmark]: TraceAbstraction took 770759.27ms. Allocated memory was 142.6MB in the beginning and 7.3GB in the end (delta: 7.2GB). Free memory was 46.7MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 5.1GB. Max. memory is 8.0GB. [2025-04-13 17:06:30,380 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 155.2MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 384.14ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 77.0MB in the end (delta: 22.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.75ms. Allocated memory is still 142.6MB. Free memory was 77.0MB in the beginning and 75.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 33.19ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 72.8MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 315.41ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 46.7MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 770759.27ms. Allocated memory was 142.6MB in the beginning and 7.3GB in the end (delta: 7.2GB). Free memory was 46.7MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 5.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (483572states) and FLOYD_HOARE automaton (currently 286 states, 94 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-39-1 term,while SimplifyDDA2 was simplifying 27 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (483572states) and FLOYD_HOARE automaton (currently 286 states, 94 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-39-1 term,while SimplifyDDA2 was simplifying 27 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 721]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (483572states) and FLOYD_HOARE automaton (currently 286 states, 94 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-39-1 term,while SimplifyDDA2 was simplifying 27 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 31 locations, 37 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 770.7s, OverallIterations: 9, TraceHistogramMax: 24, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.5s, AutomataDifference: 625.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22393 SdHoareTripleChecker+Valid, 20.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22393 mSDsluCounter, 192 SdHoareTripleChecker+Invalid, 17.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 159 mSDsCounter, 5180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44205 IncrementalHoareTripleChecker+Invalid, 49385 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5180 mSolverCounterUnsat, 33 mSDtfsCounter, 44205 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3148 GetRequests, 175 SyntacticMatches, 22 SemanticMatches, 2950 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082257 ImplicationChecksByTransitivity, 389.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=483572occurred in iteration=8, InterpolantAutomatonStates: 2333, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 122.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 122641 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 477 NumberOfCodeBlocks, 477 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 685 ConstructedInterpolants, 0 QuantifiedInterpolants, 7655 SizeOfPredicates, 112 NumberOfNonLiveVariables, 1983 ConjunctsInSsa, 383 ConjunctsInUnsatCore, 25 InterpolantComputations, 1 PerfectInterpolantSequences, 1012/4491 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown