/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:18:04,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:18:04,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 22:18:04,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:18:04,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:18:04,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:18:04,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:18:04,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:18:04,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:18:04,798 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:18:04,798 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:18:04,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:18:04,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:18:04,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:18:04,799 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:18:04,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:18:04,799 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:18:04,799 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:18:04,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:18:04,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:18:04,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:18:04,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:18:04,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:18:04,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:18:04,801 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:18:04,801 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:18:04,801 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:18:04,801 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:18:04,801 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:18:04,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:18:04,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:18:04,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:18:04,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:18:04,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:18:04,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:18:04,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:18:04,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:18:04,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:18:04,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:18:04,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:18:04,802 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:18:04,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:18:04,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:18:04,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:18:04,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:18:04,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:18:04,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:18:04,803 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 22:18:05,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:18:05,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:18:05,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:18:05,044 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:18:05,044 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:18:05,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c [2025-04-13 22:18:06,304 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/565e44446/45c5504e9d254ab5ba76bba360038000/FLAG66c50fac2 [2025-04-13 22:18:06,518 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:18:06,519 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c [2025-04-13 22:18:06,527 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/565e44446/45c5504e9d254ab5ba76bba360038000/FLAG66c50fac2 [2025-04-13 22:18:07,305 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/565e44446/45c5504e9d254ab5ba76bba360038000 [2025-04-13 22:18:07,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:18:07,308 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:18:07,309 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:18:07,309 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:18:07,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:18:07,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:18:07" (1/1) ... [2025-04-13 22:18:07,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30fc057d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:18:07, skipping insertion in model container [2025-04-13 22:18:07,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:18:07" (1/1) ... [2025-04-13 22:18:07,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:18:07,517 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c[4955,4968] [2025-04-13 22:18:07,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:18:07,539 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:18:07,592 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c[4955,4968] [2025-04-13 22:18:07,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:18:07,620 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:18:07,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:18:07 WrapperNode [2025-04-13 22:18:07,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:18:07,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:18:07,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:18:07,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:18:07,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:18:07" (1/1) ... [2025-04-13 22:18:07,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:18:07" (1/1) ... [2025-04-13 22:18:07,670 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 21, calls inlined = 29, statements flattened = 399 [2025-04-13 22:18:07,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:18:07,671 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:18:07,671 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:18:07,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:18:07,681 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:18:07" (1/1) ... [2025-04-13 22:18:07,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:18:07" (1/1) ... [2025-04-13 22:18:07,685 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:18:07" (1/1) ... [2025-04-13 22:18:07,707 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 22:18:07,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:18:07" (1/1) ... [2025-04-13 22:18:07,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:18:07" (1/1) ... [2025-04-13 22:18:07,716 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:18:07" (1/1) ... [2025-04-13 22:18:07,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:18:07" (1/1) ... [2025-04-13 22:18:07,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:18:07" (1/1) ... [2025-04-13 22:18:07,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:18:07" (1/1) ... [2025-04-13 22:18:07,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:18:07,730 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:18:07,730 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:18:07,730 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:18:07,731 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:18:07" (1/1) ... [2025-04-13 22:18:07,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:18:07,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:07,756 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 22:18:07,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 22:18:07,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:18:07,777 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:18:07,777 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:18:07,777 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:18:07,777 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:18:07,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:18:07,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 22:18:07,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 22:18:07,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 22:18:07,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 22:18:07,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:18:07,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:18:07,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 22:18:07,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 22:18:07,779 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 22:18:07,878 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:18:07,880 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:18:08,335 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:18:08,336 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:18:08,336 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:18:08,936 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:18:08,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:18:08 BoogieIcfgContainer [2025-04-13 22:18:08,936 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:18:08,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:18:08,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:18:08,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:18:08,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:18:07" (1/3) ... [2025-04-13 22:18:08,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f1d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:18:08, skipping insertion in model container [2025-04-13 22:18:08,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:18:07" (2/3) ... [2025-04-13 22:18:08,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f1d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:18:08, skipping insertion in model container [2025-04-13 22:18:08,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:18:08" (3/3) ... [2025-04-13 22:18:08,944 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-symm.wvr.c [2025-04-13 22:18:08,957 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:18:08,958 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-symm.wvr.c that has 3 procedures, 18 locations, 21 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 22:18:08,958 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:18:09,033 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 22:18:09,057 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 23 transitions, 60 flow [2025-04-13 22:18:09,067 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 33 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:09,088 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:18:09,098 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;@3ed04125, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:18:09,099 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 22:18:09,100 INFO L278 IsEmpty]: Start isEmpty. Operand has 33 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:09,104 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 22:18:09,104 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:09,104 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:09,105 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 22:18:09,108 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:09,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1979876510, now seen corresponding path program 1 times [2025-04-13 22:18:09,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:09,116 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49722801] [2025-04-13 22:18:09,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:18:09,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:09,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 22:18:09,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 22:18:09,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:18:09,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:09,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:18:09,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:09,463 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49722801] [2025-04-13 22:18:09,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49722801] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:18:09,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:18:09,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:18:09,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582728328] [2025-04-13 22:18:09,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:18:09,468 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:18:09,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:09,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:18:09,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:18:09,482 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 2.6875) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:09,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:09,554 INFO L93 Difference]: Finished difference Result 66 states and 173 transitions. [2025-04-13 22:18:09,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:18:09,557 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 22:18:09,558 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:09,562 INFO L225 Difference]: With dead ends: 66 [2025-04-13 22:18:09,562 INFO L226 Difference]: Without dead ends: 35 [2025-04-13 22:18:09,566 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:18:09,569 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:09,570 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:18:09,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-04-13 22:18:09,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-04-13 22:18:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.588235294117647) internal successors, (88), 34 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:09,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 88 transitions. [2025-04-13 22:18:09,596 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 88 transitions. Word has length 12 [2025-04-13 22:18:09,596 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:09,596 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 88 transitions. [2025-04-13 22:18:09,598 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:09,598 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 88 transitions. [2025-04-13 22:18:09,599 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 22:18:09,599 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:09,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:09,599 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:18:09,599 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 22:18:09,600 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash 405540836, now seen corresponding path program 1 times [2025-04-13 22:18:09,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:09,600 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858151691] [2025-04-13 22:18:09,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:18:09,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:09,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 22:18:09,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 22:18:09,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:18:09,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:09,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:18:09,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:09,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858151691] [2025-04-13 22:18:09,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858151691] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:09,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708004587] [2025-04-13 22:18:09,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:18:09,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:09,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:09,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:18:09,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 22:18:09,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 22:18:09,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 22:18:09,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:18:09,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:09,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 22:18:09,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:09,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:18:09,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:09,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:18:09,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708004587] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:09,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:09,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-04-13 22:18:09,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094677761] [2025-04-13 22:18:09,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:09,985 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:18:09,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:09,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:18:09,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:18:09,985 INFO L87 Difference]: Start difference. First operand 35 states and 88 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:10,054 INFO L93 Difference]: Finished difference Result 73 states and 184 transitions. [2025-04-13 22:18:10,054 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:18:10,054 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 22:18:10,054 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:10,055 INFO L225 Difference]: With dead ends: 73 [2025-04-13 22:18:10,055 INFO L226 Difference]: Without dead ends: 41 [2025-04-13 22:18:10,055 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:18:10,056 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:10,056 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:18:10,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-04-13 22:18:10,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-04-13 22:18:10,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.35) internal successors, (94), 40 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:10,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 94 transitions. [2025-04-13 22:18:10,060 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 94 transitions. Word has length 14 [2025-04-13 22:18:10,060 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:10,060 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 94 transitions. [2025-04-13 22:18:10,060 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:10,060 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 94 transitions. [2025-04-13 22:18:10,060 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:18:10,060 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:10,060 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:10,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 22:18:10,265 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:10,265 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 22:18:10,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:10,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1517394078, now seen corresponding path program 2 times [2025-04-13 22:18:10,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:10,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331179254] [2025-04-13 22:18:10,266 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:18:10,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:10,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:18:10,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 20 statements. [2025-04-13 22:18:10,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:18:10,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:11,038 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:18:11,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:11,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331179254] [2025-04-13 22:18:11,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331179254] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:18:11,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:18:11,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:18:11,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017121076] [2025-04-13 22:18:11,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:18:11,038 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:18:11,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:11,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:18:11,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:18:11,039 INFO L87 Difference]: Start difference. First operand 41 states and 94 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:11,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:11,185 INFO L93 Difference]: Finished difference Result 66 states and 132 transitions. [2025-04-13 22:18:11,186 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:18:11,186 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:18:11,187 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:11,187 INFO L225 Difference]: With dead ends: 66 [2025-04-13 22:18:11,187 INFO L226 Difference]: Without dead ends: 49 [2025-04-13 22:18:11,187 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:18:11,188 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:11,188 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:18:11,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-13 22:18:11,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2025-04-13 22:18:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.25) internal successors, (90), 40 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 90 transitions. [2025-04-13 22:18:11,196 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 90 transitions. Word has length 20 [2025-04-13 22:18:11,196 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:11,196 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 90 transitions. [2025-04-13 22:18:11,196 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:11,196 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 90 transitions. [2025-04-13 22:18:11,196 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:18:11,196 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:11,197 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:11,197 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:18:11,197 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 22:18:11,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:11,197 INFO L85 PathProgramCache]: Analyzing trace with hash -909160356, now seen corresponding path program 3 times [2025-04-13 22:18:11,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:11,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082988818] [2025-04-13 22:18:11,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:18:11,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:11,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:18:11,225 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 20 statements. [2025-04-13 22:18:11,225 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:18:11,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:11,722 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:18:11,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:11,722 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082988818] [2025-04-13 22:18:11,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082988818] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:18:11,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:18:11,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:18:11,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114650561] [2025-04-13 22:18:11,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:18:11,723 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:18:11,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:11,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:18:11,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:18:11,723 INFO L87 Difference]: Start difference. First operand 41 states and 90 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:11,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:11,827 INFO L93 Difference]: Finished difference Result 61 states and 117 transitions. [2025-04-13 22:18:11,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:18:11,827 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:18:11,827 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:11,828 INFO L225 Difference]: With dead ends: 61 [2025-04-13 22:18:11,828 INFO L226 Difference]: Without dead ends: 48 [2025-04-13 22:18:11,828 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:18:11,828 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:11,828 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:18:11,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-13 22:18:11,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2025-04-13 22:18:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.2) internal successors, (88), 40 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:11,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 88 transitions. [2025-04-13 22:18:11,832 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 88 transitions. Word has length 20 [2025-04-13 22:18:11,832 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:11,832 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 88 transitions. [2025-04-13 22:18:11,835 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:11,835 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 88 transitions. [2025-04-13 22:18:11,836 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:18:11,836 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:11,836 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:11,836 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:18:11,836 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 22:18:11,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:11,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1000270213, now seen corresponding path program 1 times [2025-04-13 22:18:11,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:11,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655004646] [2025-04-13 22:18:11,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:18:11,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:11,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:18:11,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:18:11,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:18:11,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:11,911 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:18:11,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:11,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655004646] [2025-04-13 22:18:11,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655004646] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:18:11,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:18:11,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:18:11,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325283169] [2025-04-13 22:18:11,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:18:11,912 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:18:11,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:11,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:18:11,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:18:11,912 INFO L87 Difference]: Start difference. First operand 41 states and 88 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:11,950 INFO L93 Difference]: Finished difference Result 51 states and 105 transitions. [2025-04-13 22:18:11,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:18:11,951 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:18:11,951 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:11,951 INFO L225 Difference]: With dead ends: 51 [2025-04-13 22:18:11,951 INFO L226 Difference]: Without dead ends: 41 [2025-04-13 22:18:11,951 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:18:11,952 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:11,952 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:18:11,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-04-13 22:18:11,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-04-13 22:18:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.975) internal successors, (79), 40 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 79 transitions. [2025-04-13 22:18:11,955 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 79 transitions. Word has length 21 [2025-04-13 22:18:11,956 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:11,956 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 79 transitions. [2025-04-13 22:18:11,956 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:11,956 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 79 transitions. [2025-04-13 22:18:11,956 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:18:11,956 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:11,956 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:11,956 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:18:11,956 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 22:18:11,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:11,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1745255488, now seen corresponding path program 1 times [2025-04-13 22:18:11,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:11,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308216914] [2025-04-13 22:18:11,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:18:11,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:11,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:18:11,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:18:11,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:18:11,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:18:12,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:12,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308216914] [2025-04-13 22:18:12,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308216914] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:12,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22131759] [2025-04-13 22:18:12,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:18:12,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:12,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:12,077 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:18:12,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 22:18:12,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:18:12,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:18:12,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:18:12,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:12,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 22:18:12,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:12,258 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:18:12,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:12,290 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:18:12,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22131759] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:12,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:12,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 22:18:12,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753677308] [2025-04-13 22:18:12,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:12,290 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 22:18:12,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:12,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 22:18:12,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:18:12,291 INFO L87 Difference]: Start difference. First operand 41 states and 79 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:12,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:12,345 INFO L93 Difference]: Finished difference Result 78 states and 155 transitions. [2025-04-13 22:18:12,345 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:18:12,345 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 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 22 [2025-04-13 22:18:12,346 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:12,346 INFO L225 Difference]: With dead ends: 78 [2025-04-13 22:18:12,346 INFO L226 Difference]: Without dead ends: 43 [2025-04-13 22:18:12,346 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:18:12,347 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:12,347 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:18:12,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-04-13 22:18:12,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-04-13 22:18:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 42 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:12,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 81 transitions. [2025-04-13 22:18:12,350 INFO L79 Accepts]: Start accepts. Automaton has 43 states and 81 transitions. Word has length 22 [2025-04-13 22:18:12,350 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:12,350 INFO L485 AbstractCegarLoop]: Abstraction has 43 states and 81 transitions. [2025-04-13 22:18:12,350 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:12,350 INFO L278 IsEmpty]: Start isEmpty. Operand 43 states and 81 transitions. [2025-04-13 22:18:12,351 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 22:18:12,351 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:12,351 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:12,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 22:18:12,551 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,SelfDestructingSolverStorable5 [2025-04-13 22:18:12,552 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 22:18:12,552 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:12,552 INFO L85 PathProgramCache]: Analyzing trace with hash 688499462, now seen corresponding path program 2 times [2025-04-13 22:18:12,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:12,552 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191949907] [2025-04-13 22:18:12,552 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:18:12,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:12,564 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 22:18:12,570 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 24 statements. [2025-04-13 22:18:12,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:18:12,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:12,634 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:12,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:12,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191949907] [2025-04-13 22:18:12,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191949907] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:18:12,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:18:12,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:18:12,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425565739] [2025-04-13 22:18:12,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:18:12,635 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:18:12,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:12,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:18:12,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:18:12,636 INFO L87 Difference]: Start difference. First operand 43 states and 81 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:12,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:12,683 INFO L93 Difference]: Finished difference Result 59 states and 117 transitions. [2025-04-13 22:18:12,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:18:12,683 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 24 [2025-04-13 22:18:12,684 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:12,684 INFO L225 Difference]: With dead ends: 59 [2025-04-13 22:18:12,684 INFO L226 Difference]: Without dead ends: 50 [2025-04-13 22:18:12,684 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:18:12,685 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:12,685 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:18:12,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-04-13 22:18:12,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-04-13 22:18:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 2.0) internal successors, (98), 49 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:12,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 98 transitions. [2025-04-13 22:18:12,691 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 98 transitions. Word has length 24 [2025-04-13 22:18:12,692 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:12,692 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 98 transitions. [2025-04-13 22:18:12,692 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:12,692 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 98 transitions. [2025-04-13 22:18:12,692 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:18:12,692 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:12,692 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:12,692 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:18:12,692 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 22:18:12,693 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:12,693 INFO L85 PathProgramCache]: Analyzing trace with hash 899203799, now seen corresponding path program 1 times [2025-04-13 22:18:12,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:12,693 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327986865] [2025-04-13 22:18:12,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:18:12,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:12,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 22:18:12,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:18:12,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:18:12,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:12,841 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-13 22:18:12,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:12,841 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327986865] [2025-04-13 22:18:12,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327986865] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:18:12,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:18:12,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:18:12,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249064389] [2025-04-13 22:18:12,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:18:12,842 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:18:12,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:12,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:18:12,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:18:12,843 INFO L87 Difference]: Start difference. First operand 50 states and 98 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:12,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:12,889 INFO L93 Difference]: Finished difference Result 76 states and 156 transitions. [2025-04-13 22:18:12,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:18:12,890 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 25 [2025-04-13 22:18:12,890 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:12,890 INFO L225 Difference]: With dead ends: 76 [2025-04-13 22:18:12,890 INFO L226 Difference]: Without dead ends: 60 [2025-04-13 22:18:12,891 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:18:12,891 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:12,891 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 0 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:18:12,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-13 22:18:12,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-04-13 22:18:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 2.0677966101694913) internal successors, (122), 59 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 122 transitions. [2025-04-13 22:18:12,896 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 122 transitions. Word has length 25 [2025-04-13 22:18:12,896 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:12,896 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 122 transitions. [2025-04-13 22:18:12,896 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:12,896 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 122 transitions. [2025-04-13 22:18:12,897 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:18:12,897 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:12,897 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:12,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 22:18:12,897 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 22:18:12,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:12,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2104295326, now seen corresponding path program 1 times [2025-04-13 22:18:12,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:12,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001409022] [2025-04-13 22:18:12,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:18:12,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:12,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 22:18:13,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:18:13,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:18:13,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:18,630 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:18:18,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:18,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001409022] [2025-04-13 22:18:18,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001409022] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:18,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248506724] [2025-04-13 22:18:18,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:18:18,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:18,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:18,632 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:18:18,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 22:18:18,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 22:18:18,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:18:18,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:18:18,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:18,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 22:18:18,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:19,697 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:19,698 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 326 treesize of output 278 [2025-04-13 22:18:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:20,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:22,453 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 22:18:22,454 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 334 treesize of output 303 [2025-04-13 22:18:23,073 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:23,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248506724] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:23,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:23,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7, 7] total 32 [2025-04-13 22:18:23,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13327908] [2025-04-13 22:18:23,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:23,074 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:18:23,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:23,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:18:23,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:18:23,075 INFO L87 Difference]: Start difference. First operand 60 states and 122 transitions. Second operand has 33 states, 32 states have (on average 1.6875) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:24,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:24,661 INFO L93 Difference]: Finished difference Result 102 states and 219 transitions. [2025-04-13 22:18:24,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:18:24,661 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.6875) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 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 26 [2025-04-13 22:18:24,661 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:24,662 INFO L225 Difference]: With dead ends: 102 [2025-04-13 22:18:24,662 INFO L226 Difference]: Without dead ends: 97 [2025-04-13 22:18:24,663 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=306, Invalid=2144, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:18:24,663 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 128 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:24,663 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 0 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:18:24,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-04-13 22:18:24,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 70. [2025-04-13 22:18:24,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 2.1884057971014492) internal successors, (151), 69 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:24,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 151 transitions. [2025-04-13 22:18:24,676 INFO L79 Accepts]: Start accepts. Automaton has 70 states and 151 transitions. Word has length 26 [2025-04-13 22:18:24,676 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:24,676 INFO L485 AbstractCegarLoop]: Abstraction has 70 states and 151 transitions. [2025-04-13 22:18:24,676 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.6875) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:24,676 INFO L278 IsEmpty]: Start isEmpty. Operand 70 states and 151 transitions. [2025-04-13 22:18:24,677 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:18:24,677 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:24,677 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:24,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 22:18:24,877 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:24,878 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:24,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:24,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1014048670, now seen corresponding path program 2 times [2025-04-13 22:18:24,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:24,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870990116] [2025-04-13 22:18:24,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:18:24,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:24,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:18:25,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:18:25,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:18:25,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:18:29,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:29,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870990116] [2025-04-13 22:18:29,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870990116] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:29,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659307400] [2025-04-13 22:18:29,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:18:29,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:29,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:29,162 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:18:29,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 22:18:29,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:18:29,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:18:29,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:18:29,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:29,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-04-13 22:18:29,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:29,391 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2025-04-13 22:18:29,394 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-13 22:18:29,398 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-13 22:18:29,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:18:29,438 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-04-13 22:18:29,477 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 42 [2025-04-13 22:18:29,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:18:29,480 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 60 [2025-04-13 22:18:29,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:18:29,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 22:18:29,498 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2025-04-13 22:18:29,610 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 82 [2025-04-13 22:18:29,649 INFO L325 Elim1Store]: treesize reduction 115, result has 17.3 percent of original size [2025-04-13 22:18:29,649 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 82 treesize of output 105 [2025-04-13 22:18:29,756 INFO L325 Elim1Store]: treesize reduction 72, result has 39.0 percent of original size [2025-04-13 22:18:29,756 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 65 treesize of output 95 [2025-04-13 22:18:30,376 INFO L325 Elim1Store]: treesize reduction 212, result has 60.2 percent of original size [2025-04-13 22:18:30,376 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 189 treesize of output 429 [2025-04-13 22:19:11,005 WARN L286 SmtUtils]: Spent 7.54s on a formula simplification that was a NOOP. DAG size: 1134 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 22:19:26,187 WARN L286 SmtUtils]: Spent 7.58s on a formula simplification that was a NOOP. DAG size: 1130 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 22:19:41,266 WARN L286 SmtUtils]: Spent 7.55s on a formula simplification that was a NOOP. DAG size: 1126 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 22:19:52,486 WARN L286 SmtUtils]: Spent 7.45s on a formula simplification. DAG size of input: 1115 DAG size of output: 1121 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 22:20:17,564 WARN L286 SmtUtils]: Spent 7.68s on a formula simplification that was a NOOP. DAG size: 1122 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 22:20:32,892 WARN L286 SmtUtils]: Spent 7.66s on a formula simplification that was a NOOP. DAG size: 1118 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 22:20:51,545 WARN L286 SmtUtils]: Spent 10.96s on a formula simplification. DAG size of input: 1493 DAG size of output: 1501 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 22:21:18,940 WARN L286 SmtUtils]: Spent 7.44s on a formula simplification. DAG size of input: 1107 DAG size of output: 1115 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 22:22:04,681 WARN L286 SmtUtils]: Spent 7.05s on a formula simplification. DAG size of input: 1119 DAG size of output: 1103 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 22:24:45,517 WARN L286 SmtUtils]: Spent 6.69s on a formula simplification. DAG size of input: 1123 DAG size of output: 1115 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 22:24:52,418 WARN L286 SmtUtils]: Spent 6.89s on a formula simplification that was a NOOP. DAG size: 1118 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 22:25:21,384 WARN L286 SmtUtils]: Spent 12.29s on a formula simplification. DAG size of input: 1479 DAG size of output: 1500 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 22:29:33,120 WARN L286 SmtUtils]: Spent 1.61m on a formula simplification. DAG size of input: 5656 DAG size of output: 5658 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 22:32:21,914 WARN L286 SmtUtils]: Spent 1.57m on a formula simplification. DAG size of input: 6276 DAG size of output: 6295 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2025-04-13 22:32:23,694 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 22:32:23,716 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 22:32:23,731 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 22:32:23,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 22:32:23,932 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:32:23,932 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ∧-29-3-2-2-2-1 context. [2025-04-13 22:32:23,933 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 22:32:23,934 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 22:32:23,936 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1] [2025-04-13 22:32:23,938 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:32:23,938 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:32:23,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:32:23 BasicIcfg [2025-04-13 22:32:23,939 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:32:23,940 INFO L158 Benchmark]: Toolchain (without parser) took 856631.65ms. Allocated memory was 142.6MB in the beginning and 725.6MB in the end (delta: 583.0MB). Free memory was 99.1MB in the beginning and 406.9MB in the end (delta: -307.9MB). Peak memory consumption was 556.9MB. Max. memory is 8.0GB. [2025-04-13 22:32:23,940 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 163.6MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:32:23,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.65ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 82.1MB in the end (delta: 16.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 22:32:23,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.53ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 78.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:32:23,940 INFO L158 Benchmark]: Boogie Preprocessor took 56.00ms. Allocated memory is still 142.6MB. Free memory was 77.9MB in the beginning and 75.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:32:23,943 INFO L158 Benchmark]: IcfgBuilder took 1206.52ms. Allocated memory is still 142.6MB. Free memory was 75.5MB in the beginning and 85.1MB in the end (delta: -9.6MB). Peak memory consumption was 62.7MB. Max. memory is 8.0GB. [2025-04-13 22:32:23,943 INFO L158 Benchmark]: TraceAbstraction took 855002.05ms. Allocated memory was 142.6MB in the beginning and 725.6MB in the end (delta: 583.0MB). Free memory was 84.0MB in the beginning and 406.9MB in the end (delta: -322.9MB). Peak memory consumption was 543.6MB. Max. memory is 8.0GB. [2025-04-13 22:32:23,944 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.47ms. Allocated memory is still 163.6MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 311.65ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 82.1MB in the end (delta: 16.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.53ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 78.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.00ms. Allocated memory is still 142.6MB. Free memory was 77.9MB in the beginning and 75.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 1206.52ms. Allocated memory is still 142.6MB. Free memory was 75.5MB in the beginning and 85.1MB in the end (delta: -9.6MB). Peak memory consumption was 62.7MB. Max. memory is 8.0GB. * TraceAbstraction took 855002.05ms. Allocated memory was 142.6MB in the beginning and 725.6MB in the end (delta: 583.0MB). Free memory was 84.0MB in the beginning and 406.9MB in the end (delta: -322.9MB). Peak memory consumption was 543.6MB. 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: 128]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ∧-29-3-2-2-2-1 context. - TimeoutResultAtElement [Line: 122]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ∧-29-3-2-2-2-1 context. - TimeoutResultAtElement [Line: 123]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 6 xjuncts wrt. a ∧-29-3-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 26 locations, 35 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 854.9s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 166 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1203 IncrementalHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 0 mSDtfsCounter, 1203 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 104 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=9, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 42 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 246 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 293 ConstructedInterpolants, 0 QuantifiedInterpolants, 3034 SizeOfPredicates, 45 NumberOfNonLiveVariables, 749 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 220/283 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